Quiz 6

1
Quiz 6

• A1)
• True
• A2)
• Strict ERO exactly specifies all nodes along the
  path. Whereas, loose ERO only specifies few nodes
  along the path.
• A3) Briefly describe
• In the case of loose ERO.
• A4)
• RRO
• A5)
• To disseminate link state information (such as
  bandwidth, link colors etc.) and build TE
  topology DB. Without TE DB, it is not possible to
  compute constraint-based path.

2
Quiz 6

• A6)
• False (LSP Id is different)
• A7)
• RSVP-TE, PathCalc, Link Management, TE Topology
  DB.
• A8)
• PathCalc
• A9)
• R3 generates a PathErr message upstream (towards
  R2).
• A10)
• Operator
• Periodic re-optimization timer expiry
• Network events (BW changes, link up/down event)