RE: AD review for draft-ietf-rtgwg-multihomed-prefix-lfa-06

Uma Chunduri <> Wed, 28 March 2018 23:32 UTC

Return-Path: <>
Received: from localhost (localhost []) by (Postfix) with ESMTP id 9FD69129C6A; Wed, 28 Mar 2018 16:32:19 -0700 (PDT)
X-Virus-Scanned: amavisd-new at
X-Spam-Flag: NO
X-Spam-Score: -4.212
X-Spam-Status: No, score=-4.212 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, RCVD_IN_DNSWL_MED=-2.3, RCVD_IN_MSPIKE_H2=-0.001, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01] autolearn=ham autolearn_force=no
Received: from ([]) by localhost ( []) (amavisd-new, port 10024) with ESMTP id hgrKa80TrpvE; Wed, 28 Mar 2018 16:32:17 -0700 (PDT)
Received: from ( []) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by (Postfix) with ESMTPS id 8460D12895E; Wed, 28 Mar 2018 16:31:22 -0700 (PDT)
Received: from (unknown []) by Forcepoint Email with ESMTP id 090651E511E7D; Thu, 29 Mar 2018 00:31:19 +0100 (IST)
Received: from ( by ( with Microsoft SMTP Server (TLS) id 14.3.382.0; Thu, 29 Mar 2018 00:31:19 +0100
Received: from ([]) by ([]) with mapi id 14.03.0382.000; Wed, 28 Mar 2018 16:31:17 -0700
From: Uma Chunduri <>
To: Martin Vigoureux <>, "" <>
CC: "" <>, Stewart Bryant <>, "" <>
Subject: RE: AD review for draft-ietf-rtgwg-multihomed-prefix-lfa-06
Thread-Topic: AD review for draft-ietf-rtgwg-multihomed-prefix-lfa-06
Thread-Index: AQHTxhbcx3QBdo2BZkqVoox+VqQBWqPmS+JQ
Date: Wed, 28 Mar 2018 23:31:17 +0000
Message-ID: <>
References: <>
In-Reply-To: <>
Accept-Language: en-US
Content-Language: en-US
x-originating-ip: []
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: base64
MIME-Version: 1.0
X-CFilter-Loop: Reflected
Archived-At: <>
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: Routing Area Working Group <>
List-Unsubscribe: <>, <>
List-Archive: <>
List-Post: <>
List-Help: <>
List-Subscribe: <>, <>
X-List-Received-Date: Wed, 28 Mar 2018 23:32:20 -0000

Hi Martin,

Thanks a lot for thorough AD review and suggestions. 

Quick response  In-line [Uma]:

Uma C. (on behal of co-authors)

-----Original Message-----
From: Martin Vigoureux [] 
Sent: Tuesday, March 27, 2018 2:59 PM
Cc:; Stewart Bryant <>om>;
Subject: AD review for draft-ietf-rtgwg-multihomed-prefix-lfa-06

Hello Authors, WG.

Thank you for putting together this Document. Thanks also to all those that reviewed it. It is well written and pretty clear (more the first part than the second though).

I have a few comments, all of them minor and mainly intended for clarification.
[Uma]: We are in the process of addressing your comments and shall come back with responses.

However, I'd like these to be addressed before moving to IETF LC, just to avoid them being picked up again.
[Uma]: WGLC has been done for this document and I am not sure any subsequent changes to address the comments warrant another WGLC. 


s/This documents/This document/

Requirements Language
Please switch from 2119 to 8174

Section 3
I am under the impression that few clarifications are needed here.
The Document says:
         Link-Protection + Downstream-paths-only :
         1. Evaluate the link-protecting + downstream-only LFA inequality

    When computing a downstream-only LFA, in addition to being a prefix-
    originator of P, router N MUST also satisfy the downstream-only LFA
    inequality specified in Figure 1.

* do you mean: MUST be prefix originator of P and MUST also satisfy?
* this paragraph basically says (taking out the prefix originator part): 
if one wants a downstream path only LFA then the downstream path inequality must be satisfied. This seems like stating the obvious. Is that needed?
* step 1 above makes no reference to N having to be prefix originator of P. There is thus an ambiguity between this last paragraph and description of the steps.
* Also, strictly speaking there is no "downstream-only LFA inequality" 
in Figure 1. That inequality is in RFC 5286. Figure 1 shows the "Link-Protection + Downstream-paths-only" inequality.

The Document also says:
    In case an alternate neighbor N is also one of the prefix-originators
    of prefix P, N MAY be selected as a valid LFA for P since being a
    prefix-originator it is guaranteed that N will not loop back packets
    destined for prefix P to computing router S.

    However, if N is not a prefix-originator of P, the computing router
    SHOULD evaluate one of the corresponding LFA inequalities, as
    mentioned in Figure 1, once for each remote node that originated the
    prefix.  In case the inequality is satisfied by the neighbor N router
    S MUST choose neighbor N, as one of the valid LFAs for the prefix P.

These two paragraphs are in the main body of the section, giving the impression that their applicability is global to the three cases. It looks to me that they are only valid for node and link protection cases. 
I would clarify that.

Also, in the first of these two paragraphs, the use of MAY suggests that one may not select N as the LFA, but the description of the algorithm does not give this degree of freedom (If .. select ...). So, is that a MAY?

Section 3.1
This looks like a duplicate compared to the paragraph which sits above it in the Document:
    The approach specified in [RFC5286] Section 6.1 last paragraph, is to
    simplify the MHP as solely attached to the router that was its pre-
    failure optimal point of attachment; though it is a scalable approach
    and simplifies computation, [RFC5286] notes this MAY result in little
    less coverage.

Section 4.2 (and subsections) is (are) a bit difficult to read/understand because of the typos but also because of the way it's written.

Section 4.2.1.
Do you mean ECMP FRR rather than simply ECMP (as section 4.2.3. seems to suggest)?
If so, please take this into account while addressing typos listed below.

Sections 4.2.2., 4.2.3., and 4.2.5, seem to be linked to 4.2.1.. 
Wouldn't it be better to switch 4.2.4. and 4.2.5.? Alternatively can't these three sections in fact be subsections of 4.2.1 ?

Although Sections 4.2.2., 4.2.3., and 4.2.5 seem to paraphrase 4.2.1., I read one sentence which does not appear in the pseudo algorithm:
    If there are two ASBRs with different type2 cost, the higher cost
    ASBR is pruned.
So I am not sure to understand when this condition/action comes into play. Could you clarify?

Section 4.2.4
It is not clear which inequalities will apply in that case.

In the same way as above, Section 4.2.5 seems to say a more than Step 5 of the pseudo algorithm. Could you clarify when the extra conditions it describes come into play? Or said differently, shouldn't step 5 be reworked to be more complete? If you do so, please rework that step incorporating the types of changes/rephrasing I have suggested for the other steps (see typos below).

Section 9
I don't disagree with what is written here, but do you think this is sufficient?

Section 10
Shouldn't rfc5714 be referenced since the inequalities use the principles set forth in that rfc?

Typos/Editorial comments:
s/for a multi-homed prefixes/for multi-homed prefixes/

s/This document also provide/This document also provides/

indentation on second line:
       Cost (X,P)   - Cost of reaching the prefix P from prefix
                     originating node X.

s/Else, evaluate the link-protecting/Else, evaluate the Link-Protection/

s/Evaluate the link-protecting + downstream-only/Evaluate the 
Link-Protection + Downstream-paths-only/

s/Else, evaluate the appropriate node-protecting/Else, evaluate the 

s/one of the corresponding LFA inequalities/the corresponding LFA 
inequality/ ?

s/a router compute/a router computes/

In Section 3.1, please capitalize 'p' in text and figure to be 
consistent with the rest of the Document and the Terminology section.

s/a MHP/an MHP/ (not sure about that though)

may be it's only me but these sentences are hard to parse:
    This document specifies, potentially
    a node MAY consider a default route is being advertised from the
    border L1/L2 router where ATT bit is set and can do LFA computation
    for the default route.  But, when multiple ECMP L1/L2 routers are
    reachable in an L1 area corresponding best LFAs SHOULD be given for
    each primary next-hop associated with default route.

s/Inequalities described in sec 2 would also apply to multi-homed 
external prefixes as well./Inequalities described in Section 2 would 
also apply to multi-homed external prefixes./

s/Loop free Alternates/Loop Free Alternates/

    For the selection of alternate ASBR for LFA consideration, additional
    rules have to be applied in selecting the alternate ASBR due to the
    external route calculation rules imposed by [RFC2328].
remove "in selecting the alternate ASBR"

    This document also defines the inequalities defined in [RFC5286]
    specifically for the alternate loop-free ASBR evaluation.
    This document defines inequalities specifically for the alternate
    loop-free ASBR evaluation, based on those [RFC5286].

    1a. if primary ASBR and alternate ASBR are intra area
        non-backbone path go to step 2.
do you mean "belong to" rather than "are"?

   2. If cost type (type1/type2) advertised by alternate
      ASBR same as primary
Do you mean:
   2. Compare cost types (type1/type2) advertised by alternate ASBR and
      by the primary ASBR

s/If not, same /If not the same type/

   3. If cost type is type1
             3a. If cost is same, program ECMP and return.
             3b. else go to step 5.
Do you mean:
   3. If cost types are type1, compare costs advertised by alternate ASBR
      and by the primary ASBR
             3a. If costs are the same then program ECMP and return.
             3b. else go to step 5.

   4  If cost type is type 2
             4a. If cost is different, skip alternate ASBR and
                     consider next ASBR.
             4b. If type2 cost is same, proceed to step 4c to compare
                     compare type 1 cost.
             4c. If type1 cost is also same program ECMP and return.
             4d. If type 1 cost is different go to step 5.
Do you mean:
   4  If cost types are type2, compare costs advertised by alternate ASBR
      and by the primary ASBR
             4a. If costs are different, skip alternate ASBR and
                     consider next ASBR.
             4b. If cost are the same, proceed to step 4c to compare
                     compare type1 costs.
             4c. If type1 costs are also same program ECMP and return.
             4d. If type1 costs are different go to step 5.

    While selecting alternate ASBR for loop evaluation for LFA, these
    rules should be applied and ensured that the alternate neighbor does
    not loop the traffic back.
I'm not sure about the meaning of the latter part of that sentence ("and 
ensured ...")

Figures 6 and 7, please add:
       P            - The multi-homed prefix being evaluated for
                      computing alternates

s/Section 3.5 and 3.6 of [RFC5286] describes/Sections 3.5 and 3.6 of 
[RFC5286] describe/

s/as defined in for IS-IS/as defined for IS-IS/

s/destined to D2 continue/destined to D2 continues/