Hi Victor,
Just one quick comment!
You say in section 3
Additionally, the BGP-LS speaker can be configured to send the
> complete list of TE Links, including its details. In this case,
> the parent PCE has access to an extended database, with visibility
> of both intra-domain and inter-domain information and can compute
> the sequence of domains with better accuracy. Even, the pPCE
> could have enough information to compute the whole end-to-end path
> by itself.
But this would go against RFC6805, which says in section 4.4
The topology and available resources within the child domain do
> not need to be communicated to the parent PCE: doing so would
> violate the PCE architecture.
Transferring all information to parent PCE, would make it an "all
seeing eye" which was never its intention.
Regards,
Dhruv
On Wed, Oct 23, 2013 at 8:16 PM, Victor Lopez <[email protected]> wrote:
> Dear all,
>
> We have submitted a draft to describe how existing mechanisms (BGP-LS) can
> be used in H-PCE scenarios to feed the TED. Although PCE is very well
> defined, it is open to interpretation how to get the TED parameters.
>
> Any comments or suggestions are highly welcome!
>
> Victor, Oscar, Daniel and Stefano
>
>
> El 21/10/13 21:39, "[email protected]" <[email protected]>
> escribió:
>
> >
> >A new version of I-D, draft-lopez-pce-hpce-ted-00.txt
> >has been successfully submitted by Victor Lopez and posted to the
> >IETF repository.
> >
> >Filename: draft-lopez-pce-hpce-ted
> >Revision: 00
> >Title: Traffic Engineering Database dissemination for
> Hierarchical PCE
> >scenarios
> >Creation date: 2013-10-21
> >Group: Individual Submission
> >Number of pages: 10
> >URL:
> >http://www.ietf.org/internet-drafts/draft-lopez-pce-hpce-ted-00.txt
> >Status: http://datatracker.ietf.org/doc/draft-lopez-pce-hpce-ted
> >Htmlized: http://tools.ietf.org/html/draft-lopez-pce-hpce-ted-00
> >
> >
> >Abstract:
> > The PCE architecture is well-defined and may be used to compute the
> > optimal path for LSPS across domains in MPLS-TE and GMPLS networks.
> > The Hierarchical Path Computation Element (H-PCE) [RFC6805] was
> > developed to provide an optimal path when the sequence of domains is
> > not known in advance. The procedure and mechanism for populating the
> > Traffic Engineering Database (TED) with domain topology and link
> > information used in H-PCE-based path computations is open to
> > interpretation. This informational document describes how topology
> > dissemination mechanisms may be used to provide TE information
> > between Parent and Child PCEs (within the H-PCE context). In
> > particular, it describes how BGP-LS might be used to provide inter-
> > domain connectivity. This document is not intended to define new
> > extensions, it demonstrates how existing procedures and mechanisms
> > may be used.
> >
> >
> >
> >
> >
> >Please note that it may take a couple of minutes from the time of
> >submission
> >until the htmlized version and diff are available at tools.ietf.org.
> >
> >The IETF Secretariat
> >
>
>
> ________________________________
>
> Este mensaje se dirige exclusivamente a su destinatario. Puede consultar
> nuestra política de envío y recepción de correo electrónico en el enlace
> situado más abajo.
> This message is intended exclusively for its addressee. We only send and
> receive email on the basis of the terms set out at:
> http://www.tid.es/ES/PAGINAS/disclaimer.aspx
> _______________________________________________
> Pce mailing list
> [email protected]
> https://www.ietf.org/mailman/listinfo/pce
>
_______________________________________________
Pce mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/pce
