5.9. STUDY QUESTIONS

  1. Referring back to Figures 5.2, 5.3 and 5.4, how does reoptimization of the LSP path in area 1 affect the amount of state in areas 0 and 2 when the LSP is signaled using (a) the contiguous method, (b) stitching and (c) nesting?

  2. Referring back to Figures 5.2, 5.3 and 5.4, how is protection against a failure of link ABR2-R1 accomplished when the LSP is signaled using (a) the contiguous method, (b) stitching and (c) nesting?

  3. Referring back to Figures 5.2, 5.3 and 5.4, assume the discussion is about three ASs, each having a different EXP bit mapping for voice traffic. How could a voice LSP be set up across the three ASs, such that traffic is forwarded using the correct EXP bits in each AS, when the LSP setup method is (a) end-to-end, (b) stitching and (c) nesting?

  4. What are the assumptions required for successfully using the ERO expansion method of path computation if the addresses of the border routers are manually configured at the head end?

  5. What are some of the advantages and disadvantages of using a path computation element to perform path computation?

  6. In what ways do an offline path computation tool and a path computation element differ?

  7. What are some of the challenges of setting up interdomain LSPs in an interprovider deployment?

Get MPLS-Enabled Applications: Emerging Developments and New Technologies now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.