Reported By: Nikolai Malykh
Date Reported: 2012-04-02
Held for Document Update by: Adrian Farrel
Date Held: 2012-04-03

Section 3.1 says:

An induced MPLS graph consists of a set of LSRs which comprise the
nodes of the graph and a set of LSPs which provide logical point to
point connectivity between the LSRs, and hence serve as the links of
the induced graph. it may be possible to construct hierarchical
induced MPLS graphs based on the concept of label stacks (see [1]).

It should say:

An induced MPLS graph consists of a set of LSRs which comprise the
nodes of the graph and a set of LSPs which provide logical point to
point connectivity between the LSRs, and hence serve as the links of
the induced graph. It may be possible to construct hierarchical
induced MPLS graphs based on the concept of label stacks (see [1]).