The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS
draft-ietf-pce-hierarchy-fwk-05
Yes
(Stewart Bryant)
No Objection
(Barry Leiba)
(Benoît Claise)
(Gonzalo Camarillo)
(Martin Stiemerling)
(Robert Sparks)
(Ron Bonica)
(Russ Housley)
(Sean Turner)
(Wesley Eddy)
Recuse
(Adrian Farrel)
Note: This ballot was opened for revision 05 and is now closed.
Stewart Bryant Former IESG member
Yes
Yes
()
Unknown
Barry Leiba Former IESG member
No Objection
No Objection
()
Unknown
Benoît Claise Former IESG member
No Objection
No Objection
()
Unknown
Brian Haberman Former IESG member
No Objection
No Objection
(2012-09-05)
Unknown
I have no problems with the publication of this document and only have the following comment. - The discussion of objective functions seems incomplete. Section 4.1 talks about deriving an optimal end-to-end path based on an OF or set of OFs. However, in talking with one of the authors, it became clear that the same OF (or set of OFs) may not be applied across all domains given local policy within a domain and/or contractual arrangements between domains. I think it would be useful to add some discussion of these types of issues and the impact they will have on the optimality of the computed path.
Gonzalo Camarillo Former IESG member
No Objection
No Objection
()
Unknown
Martin Stiemerling Former IESG member
No Objection
No Objection
()
Unknown
Robert Sparks Former IESG member
No Objection
No Objection
()
Unknown
Ron Bonica Former IESG member
No Objection
No Objection
()
Unknown
Russ Housley Former IESG member
No Objection
No Objection
()
Unknown
Sean Turner Former IESG member
No Objection
No Objection
()
Unknown
Stephen Farrell Former IESG member
No Objection
No Objection
(2012-09-12)
Unknown
TED is used before being defined (on p11)
Wesley Eddy Former IESG member
No Objection
No Objection
()
Unknown
Adrian Farrel Former IESG member
Recuse
Recuse
()
Unknown