Re: [Pce] Comments on draft-chen-pce-forward-search-p2p-path-computation-00.txt

Huaimo Chen <huaimo.chen@huawei.com> Mon, 28 March 2011 20:31 UTC

Date: Mon, 28 Mar 2011 20:32:57 +0000
From: Huaimo Chen <huaimo.chen@huawei.com>
In-reply-to: <AAC09C6F-24A5-4F00-B0FD-0EC38EE7728D@cisco.com>
To: JP Vasseur <jpv@cisco.com>
Message-id: <5316A0AB3C851246A7CA5758973207D40493D394@dfweml503-mbx.china.huawei.com>
MIME-version: 1.0
Content-type: text/plain; charset="us-ascii"
Content-language: en-US
Content-transfer-encoding: 7bit
Accept-Language: en-US
Thread-topic: Comments on draft-chen-pce-forward-search-p2p-path-computation-00.txt
Thread-index: AQHL7SNNvlZalaKfNES3z1WEZqM1aJRChKkg
Cc: "pce@ietf.org" <pce@ietf.org>
Subject: Re: [Pce] Comments on draft-chen-pce-forward-search-p2p-path-computation-00.txt
Precedence: list

Hi JP,

    Thanks for your comments!
    My answers are inline below.

Best Regards,
Huaimo
-----Original Message-----
From: JP Vasseur [mailto:jpv@cisco.com] 
Sent: Monday, March 28, 2011 3:36 AM
To: Huaimo Chen
Cc: pce@ietf.org
Subject: Comments on draft-chen-pce-forward-search-p2p-path-computation-00.txt

Few comments:
1) What makes you think that you cannot enforce the set of domains that you want to explore with BRPC 
using the IRO object specified in RFC5441?

Huaimo: This seems that there are some misunderstandings. I did not say that we could not enforce the sequence of domains or the set of domains that we want BRPC to explore using the IRO object. What I say is that the sequence of domains needs to be provided to BRPC in advance. 
 
2) If you have a mesh of domains and you try to compute the shortest inter-domain LSP according to some
metric, you just cannot afford not to explore all of them (unless you make use of some super-TED comprising 
resources information on all domains). This is true whether you use of forward or backward path computation ?

Huaimo: My understanding is that BRPC will explore all the possible sequence of domains, compute the shortest path for each sequence of domains and select the shortest one. The forward search method works differently. It searches the shortest path in the way same as the normal CSPF does. It searches the special topology once and gets the shortest path. It will not explore all the possible sequence of domains.

I am trying to understand your claim about why forward computation would solve these problems ?

Huaimo: In the sense of that the forward search computation does not need any sequence of domains in advance, it guarantees that the path found is shortest, and it is efficient even for a topology of meshed domains.

Thanks.

JP.

[Pce] Comments on draft-chen-pce-forward-search-p… JP Vasseur
Re: [Pce] Comments on draft-chen-pce-forward-sear… JP Vasseur
Re: [Pce] Comments on draft-chen-pce-forward-sear… Huaimo Chen
Re: [Pce] Comments on draft-chen-pce-forward-sear… Huaimo Chen