|
Hi, JP: I
have read your draft, draft-vasseur-pce-brpc-01.txt, and I have a
question. In
Draft: Step 2: PCE(n) computes VSPT(n) made of
the list of shortest constrained path(s) between every
BR-en(j,n) and the TE LSP destination using a suitable path
computation algorithm (e.g. CSPF) and returns the computed VSPT(n) to
PCE(n-1). My question is: How does PCE know who are the
entry nodes or exit nodes of a domain? Lack of this information, PCE can not
compute the path in the domain. If the information is included in the predetermined
domain path set? Maybe the question is naïve and simple; could
you give me some explanations? Thanks XingFeng Jiang |
_______________________________________________ Pce mailing list [email protected] https://www1.ietf.org/mailman/listinfo/pce
