Hw for ATM and MPLS 1.

When an ATM cell is delivered across a network, does its HEC keep constant or it a! chan"e# Wh!# $. S%ppose a train of &P packets arrives at a node and there is no "ap 'etween consec%tive packets, please desi"n a sche e to perfor packet delineation. That is, identif! the 'o%ndaries 'etween packets. (hint) refer the delineation of ATM* +. &n &P over ATM, &P packets a! need to 'e se" ented into %ltiple se" ents '! the AAL la!er. Then each se" ent is p%t as the pa!load of an ATM cell. ,o !o% think a se-%ence n% 'er %st 'e added to each se" ent '! the AAL la!er# Wh!# .. ,isc%ss wh! the ro%tin" calc%lation in MPLS does not s%ffer fro slow conver"ence while &P ro%tin" does. /. &n MPLS there is a fast fail%re recover! sche e called LSP protection. The first t!pe of LSP protection is link0'ased, which eans for each link we esta'lish a protection LSP. &n the followin" fi"%re, the 'l%e LSP is %sed to protect the link 'etween , and E. The second t!pe is path0'ased, which eans an end0to0end LSP is esta'lished for protection. &n the followin" fi"%re, the read LSP is %sed to protect the "reen LSP. 1f co%rse if link0 'ased protection is %sed, we have to set %p + protection LSPs for the "reen path) one for A02, one for 20, and one for ,0E. 2ased on !o%r knowled"e a'o%t MPLS and !o%r %nderstandin" of hi"h0speed networks, co pare link0'ased and path0'ased protection sche e for advanta"es and disadvanta"es.