Homework_3_Fall_2010 - CS 132 Computer Networks University...

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

View Full Document Right Arrow Icon
1 CS 132 Fall 2010 Homework 3 CS 132 – Computer Networks University of California, Irvine Fall 2010 Homework 3 Q1: What are 2 solutions to reducing the Flooding Algorithm’s Duplicate Packets problem? Q2: What is the difference between Adaptive Routing and Non Adaptive Routing algorithms? Name three different types of Adaptive Routing algorithms? Q3: Among the following routing algorithms: Hot Potato Routing, Backward Learning, Shortest Path, Flooding, Distance Vectors and Link State Routing _________________ are/is Non Adaptive routing algorithms. __________________ are/is isolated Adaptive routing algorithms. __________________ are/is distributed adaptive routing algorithms. Q4: Backward learning routing algorithm is not aware of network topology at the initial state. T or F Q5: Bellman - Ford Algorithm: In the graph below, each router maintains a table containing the best-known distance to each destination router. Each router updates its table by exchanging the routing information with its immediate neighbors at regular time intervals. Initially the router tables are as follows Table at A Table at B Table at C Table at D Table at E Distance to A 0 2 6 4 8 Distance to B 2 0 4 2 6 Distance to C 6 4 0 6 3 Distance to D 4 2 6 0 4 Distance to E 8 6 3 4 0 A C B D 6 2 4 E 4 2 3
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 CS 132 Fall 2010 Homework 3 a) The delay (distance) of the link B - D increases to 10. Write the router tables after each exchange for the first three exchanges after the delay of link B-D increases. b) For the same graph above with the initial router tables given. Imagine that the link from B – D went down entirely and no information could be passed directly between these two routers. Routers B and D immediately know of the failure and update their routing table based on a previous exchange. Write down the router tables after each exchange for the next 4 exchanges. Comment on the accuracy of the information at each router. Q6: What is the Count – to – Infinity Problem? Which of the following algorithms suffers from the Count – to –Infinity problem? (a) Hot Potato Routing (b) Shortest Path (c) Distance Vector Routing Q7: What does OSPF stand for? Explain OSPF routing algorithm. For the topology in HW Q5 above, what information would an LSA update from the designated router hold? From the information contained in the LSA update, draw the topology and practice calculating shortest paths using Dijskstra’s method. Q8: OSPF is based on Distance Vector algorithm. T or F RIP is based on Distance Vector algorithm T or F. Q9: Comparing IPv6 with IPv4, which of the following statement is true ? (circle your answer ) (1). IP v6 provides support for flows. (2). IP v4 uses a 32 bit (4 bytes) address. (3).
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/24/2011 for the course CS 132 taught by Professor Suda,t during the Fall '08 term at UC Irvine.

Page1 / 13

Homework_3_Fall_2010 - CS 132 Computer Networks University...

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

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