Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-express-path
Alia Atlas <akatlas@gmail.com> Tue, 09 July 2013 16:42 UTC
Return-Path: <akatlas@gmail.com>
X-Original-To: mpls@ietfa.amsl.com
Delivered-To: mpls@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 7877F21F8BCE for <mpls@ietfa.amsl.com>; Tue, 9 Jul 2013 09:42:09 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: 2.396
X-Spam-Level: **
X-Spam-Status: No, score=2.396 tagged_above=-999 required=5 tests=[AWL=-4.994, BAYES_00=-2.599, CN_BODY_35=0.339, GB_SUMOF=5, HTML_MESSAGE=0.001, J_BACKHAIR_11=1, J_CHICKENPOX_47=0.6, J_CHICKENPOX_48=0.6, MIME_CHARSET_FARAWAY=2.45, NO_RELAYS=-0.001]
Received: from mail.ietf.org ([12.22.58.30]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id DiOG+C1-cqIR for <mpls@ietfa.amsl.com>; Tue, 9 Jul 2013 09:42:08 -0700 (PDT)
Received: from mail-ie0-x230.google.com (mail-ie0-x230.google.com [IPv6:2607:f8b0:4001:c03::230]) by ietfa.amsl.com (Postfix) with ESMTP id 37ED721F9D0F for <mpls@ietf.org>; Tue, 9 Jul 2013 09:42:08 -0700 (PDT)
Received: by mail-ie0-f176.google.com with SMTP id ar20so13390750iec.35 for <mpls@ietf.org>; Tue, 09 Jul 2013 09:42:07 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type; bh=Zsqrxlii/JaJnyrA9iU4Bj/lNiApBOtaEcOAXslQlPQ=; b=i0cekTw2J6706i1XS05YG4abAmbIEFryvwmL9CPbxLezdK5i+JcnsQF5h+ppe4Gn15 ddrIJddKrPuh/F5KnF/FxLtnPsL+kGn/SaDI6chhOkLKBVip0q/eSRcfSH7RqWquoffQ z6saWzpIcjGXgpcikrTg2hOr/cn1nAgewgOj6HcsLO7qFDsuEODBucvoaaIv6Cr9/kzL IL3Pu54Dkby9vRSdNwsbEGlnrHGq4POVsjJCUoo9Huma3k6NPT9EaSthJ9kvIEoO1e9R ajy2czSkMk+3FGupqHrOcX3SIomnxoATSADq/gvMNq/aplRUYpKLebeFteQZZRPp0z66 ELog==
MIME-Version: 1.0
X-Received: by 10.43.0.67 with SMTP id nl3mr8794453icb.2.1373388127760; Tue, 09 Jul 2013 09:42:07 -0700 (PDT)
Received: by 10.64.47.168 with HTTP; Tue, 9 Jul 2013 09:42:07 -0700 (PDT)
In-Reply-To: <1FEE3F8F5CCDE64C9A8E8F4AD27C19EE07F5BBD3@NKGEML512-MBS.china.huawei.com>
References: <515FA9AF.7080705@pi.nu> <1FEE3F8F5CCDE64C9A8E8F4AD27C19EE07F5BBD3@NKGEML512-MBS.china.huawei.com>
Date: Tue, 09 Jul 2013 12:42:07 -0400
Message-ID: <CAG4d1re_dt7LBg7DWwtq4M3XYtq8tZMZDk6jwNrgo6-3fzz2JA@mail.gmail.com>
From: Alia Atlas <akatlas@gmail.com>
To: Xuxiaohu <xuxiaohu@huawei.com>
Content-Type: multipart/alternative; boundary="bcaec511e1b67e7a5804e116d705"
Cc: "mpls@ietf.org" <mpls@ietf.org>, "draft-atlas-mpls-te-express-path@tools.ietf.org" <draft-atlas-mpls-te-express-path@tools.ietf.org>, Loa Andersson <loa@pi.nu>, "mpls-chairs@tools.ietf.org" <mpls-chairs@tools.ietf.org>
Subject: Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-express-path
X-BeenThere: mpls@ietf.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: Multi-Protocol Label Switching WG <mpls.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/mpls>, <mailto:mpls-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/mpls>
List-Post: <mailto:mpls@ietf.org>
List-Help: <mailto:mpls-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/mpls>, <mailto:mpls-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 09 Jul 2013 16:42:09 -0000
Hi Xuxiaohu, I apologize for the long delay in responding. On Wed, Apr 10, 2013 at 12:17 AM, Xuxiaohu <xuxiaohu@huawei.com> wrote: > Hi all, > > I have reviewed this doc. I believe this doc is useful, but I have a few > comments as follows for consideration: > > 1. in section 2.1, it said " While it has been possible to compute a CSPF > where the link latency > values are used instead of TE metrics, this results in ignoring the > TE metrics and causing LSPs to prefer the lowest-latency paths. > Instead of this approach to minimize path latency, an end-to-end > latency bound merely requires that the path computed be no more than > that bound without being the minimum. This bound can be used as a > constraint in CSPF to prevent exploring links that would create a > path over the end-to-end latency bound. > > This is illustrated as follows. Let the LSP have an end-to-end > latency bound of 20ms. Assume that the path to node X has been > minimized and its latency is 12ms. When X's links are to be > explored, the link X<->Y has a link latency of 5ms and the link X<->Z > has a link latency of 9ms. The path via X to Y along link X<->Y > would have a path latency of 12ms + 5ms = 17ms < 20ms; therefore, the > link X<->Y can be explored. In contrast, reaching Z via link X<->Z > would result in a path latency of 12ms + 9ms = 21ms > 20ms; therefore > the link X<->Z would not be explored in the CSPF." > > Comment: According to an above statement of " an end-to-end latency > bound merely requires that the path computed be no more than that bound > without being the minimum ", it seems that latency is not used as a metric > for SPF algorithm but only used as a constraint. If so, how do you decide > which specific link(s) of the first-round calculated SPF path should be > pruned prior to executing the second-round SPF calculation? The same > question exists when considering end-to-end packet loss ratio and latency > variation bounds. The example illustrated in the draft seems not clear to > me. Would any co-author please clarify the above doubt? > I am not sure where the confusion lies. This is known to be a heuristic rather than an optimal algorithm, as is written. I do not know what you precisely mean by a first-round calculated SPF vs. a second-round SPF calculation. I've added the following pseudo-code example: CSPF_with_bound(root, latency_bound) root.distance = 0 root.latency = 0 fibheap_insert(root, root.distance) while (fibheap_not_empty()) next_rtr = fibheap_pop for each link next_link attached to next_rtr if (next_rtr.latency + next_link.latency) < latency_bound explore_link(next_rtr, next_link) Explore_Link(next_rtr, next_link) if (next_rtr.distance + next_link.metric) < next_link->neighbor.distance next_link->neighbor.distance = next_rtr.distance + next_link.metric next_link->neighbor.latency = next_rtr.latency + next_link.latency if (next_rtr.distance + next_link.metric) == next_link->neighbor.distance if (next_rtr.latency + next_link.latency) < next_link->neighbor.latency next_link->neighbor.latency = next_rtr.latency + next_link.latency > 2. in section 2.1, it said "For link loss, the path loss is not the sum > of the used links' > losses. Instead, the path loss percentage is (100 - loss_L1)*(100 - > loss_L2)*...*(100 - loss_Ln), where the links along the path are L1 > to Ln. The end-to-end link loss bound, computed in this fashion, can > also be used as a constraint in the CSPF on what links to explore". > > Comment: I guess co-authors wanted to say packet loss ratio here. If > so, the formula of packet loss ratio here needs to be correctly expressed. > This should have had 100 - in front of it - so basically the path loss percentage is (100 - ((100 - loss_L1)*...(100 - loss_Ln)) (100 - loss_L1) is the traffic that makes it to link 2 (L2) and then (100 - loss_L1)*(100 - loss_L2) is the traffic that makes it to L3 and so. ((100 - loss_L1) *... (100 - loss_Ln)) is the percentage of traffic that makes it to the end of the path. > 3. In section 2.2, it said " When computing > the path for a TE tunnel, only links with at least a configurable > amount of Unidirectional Available Bandwidth might be permitted." > > Comment: I wonder whether it is suitable to consider Residual Bandwidth > and Unidirectional Available Bandwidth parameters as performance metrics > and therefore discuss them in this doc. Furthermore, whether or not the > measured bandwidth used for the actual forwarding of non- > RSVP-TE LSP packets should be a constraint for CSPF depends on many > factors, such as whether or not this bandwidth can be occupied by future > RSVP-TE LSP traffic. Hence, maybe it's more suitable to discuss in details > the bandwidth constraint related issues in a separate doc. > Does more need to be said about this? It's an ingress decision based on configuration... Thanks for the review! Alia > > Best regards, > Xiaohu > > > > -----邮件原件----- > > 发件人: Loa Andersson [mailto:loa@pi.nu] > > 发送时间: 2013年4月6日 12:51 > > 收件人: Dutta, Pranjal K (Pranjal); Sriganesh Kini; Rajiv Asati (rajiva); > Xuxiaohu; > > draft-atlas-mpls-te-express-path@tools.ietf.org; > mpls-chairs@tools.ietf.org > > 主题: MPLS-RT review of draft-atlas-mpls-te-express-path > > > > Xiaohu, Sri, Rajiv and Pranjal, > > > > You have been selected as an MPLS Review team reviewers for > > draft-atlas-mpls-te-express-path-02. > > > > Note to authors: You have been CC'd on this email so that you can know > > that this review is going on. However, please do not review your own > > document. > > > > Reviews should comment on whether the document is coherent, is it > > useful (ie, is it likely to be actually useful in operational > > networks), and is the document technically sound? We are interested > > in knowing whether the document is ready to be considered for WG > > adoption (ie, it doesn't have to be perfect at this point, but should be > > a good start). > > > > Reviews should be sent to the document authors, WG co-chairs and > > WG secretary, and CC'd to the MPLS WG email list. If necessary, comments > > may be sent privately to only the WG chairs. > > > > Are you able to review this draft by April 20, 2013? > > > > Thanks, Loa > > (as MPLS WG chair) > > > > /Loa > > -- > > > > > > Loa Andersson email: loa@mail01.huawei.com > > Senior MPLS Expert loa@pi.nu > > Huawei Technologies (consultant) phone: +46 739 81 21 64 > _______________________________________________ > mpls mailing list > mpls@ietf.org > https://www.ietf.org/mailman/listinfo/mpls >
- Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-… Xuxiaohu
- Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-… Xuxiaohu
- Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-… Sriganesh Kini
- Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-… Alia Atlas
- Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-… Alia Atlas
- Re: [mpls] MPLS-RT review of draft-atlas-mpls-te-… Alia Atlas