This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Mid term II CS 352 (Nov 20, 2008) I. Quickies (20 points) a. When a IP packet is fragmented, how does an end-host know that a IP fragment is missing, How does an end-host know that fragments belong to two different IP packets b. Differentiate between unicast and multicast c. What is the difference between poison reverse and split-horizon. Why use poison-reverse as opposed to just split-horizon? d. In BGP, how are local-PREF and MED values used? Give example for each e. Explain the advantages and disadvantages of centralized routing algorithms and decentralized routing algorithms. II. Link State Routing (20 points) a. Use Dijkstra’s shortest path algorithm to determine the shortest paths from node A in the network shown in the figure. b. Recompute the shortest paths from Node A when the link cost of EC changes from 1 to 5. Figure for Problem II (Link state routing) III Distance Vector Algorithm (20 Points) a. Compute the distance vector table at A after node C and node D have exchanged its final distance...
View Full Document
This note was uploaded on 12/16/2010 for the course CS 352 taught by Professor Staff during the Spring '06 term at Rutgers.
- Spring '06