132B_1_EE132B Rubin Sample Final Problems 112110A

132B_1_EE132B Rubin Sample Final Problems 112110A - EE132B...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
EE132B Professor I. Rubin 1 UCLA ELECTRICAL ENGINEERING DEPARTMENT EE132B - DATA COMMUNICATIONS AND TELECOMMUNICATIONS NETWORKS Final Examination Sample Problems Professor Izhak Rubin Problem 1 a. State the differences between distance-vector and link-state based routing algorithms. b. Use Dijkstra’s algorithm, showing all steps, to derive the shortest path tree rooted at node 1 for the network graph with indicated link weights as shown below. c. Assume each link to (independently) fail, over a specified period of time, with probability 0.15. Calculate the probability that the shortest path from node 1 to node 7 stays intact over this period of time. 1 2 3 5 4 6 7 5 3 7 4 6 2 7 15 10 10
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
EE132B Professor I. Rubin 2 Problem 2 (Design Problem) Consider the output buffer buffered multiplexer of a switch or router that is connected to one of the outgoing communications links. Messages that arrive at this buffer are queued and transmitted across the outgoing communications link to the next router node. The outgoing
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/12/2011 for the course EE 132B taught by Professor Izhakrubin during the Fall '09 term at UCLA.

Page1 / 2

132B_1_EE132B Rubin Sample Final Problems 112110A - EE132B...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online