Homework3_Fall_2010_solutions

Homework3_Fall_2010_solutions - CS 132 Discussion HW3...

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

View Full Document Right Arrow Icon
School of ICS, UC Irvine 1 CS 132 CS 132 Discussion HW3 solutions
Background image of page 1

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

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 2 CS 132
Background image of page 2
School of ICS, UC Irvine 3 CS 132 #1 What are 2 solutions to reducing the Flooding Algorithm’s Duplicate Packets problem? Slide 63~65 network layer notes Solution 1 Have a hop counter in the packet header IMPs decrement each arriving packet’s hop counter IMPs discard a packet with hop count=0 Ideally, the hop counter should be initialized to the length of the path from the source to the destination
Background image of page 3

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

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 4 CS 132 #1 cont’d What are 2 solutions to reducing the Flooding Algorithm’s Duplicate Packets problem? Solution 2 Require the first hop IMP to put a sequence number in each packet it receives from its hosts Each IMP maintains a table listing the sequence numbers it has seen from each first-hop IMP. The IMP can then discard packets it has already seen.
Background image of page 4
School of ICS, UC Irvine 5 CS 132 #2 What is the difference between Adaptive Routing and Non Adaptive Routing algorithms? Name three different types of Adaptive Routing algorithms. Slide 56 and 67. Non-Adaptive Routing algorithms do not base their routing decisions on the current state of the network, but Adaptive Routing alg. do
Background image of page 5

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

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 6 CS 132 #2 Adaptive Routing: Three Types Slide 68 Centralized Adaptive Routing One central routing controller Isolated Adaptive Routing Based on local information Does not require exchange of information between routers Distributed Adaptive Routing Routers periodically exchange information
Background image of page 6
School of ICS, UC Irvine 7 CS 132 #3 Among the following routing algorithms: Hot Potato Routing Backward Learning Shortest Path Flooding Distance Vectors Link State Routing ____________ are/is non-adaptive routing algorithms
Background image of page 7

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

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 8 CS 132 #3 Among the following routing algorithms: Hot Potato Routing Backward Learning Shortest Path Flooding Distance Vectors Link State Routing ____________ are/is isolated adaptive routing algorithms
Background image of page 8
School of ICS, UC Irvine 9 CS 132 #3 Among the following routing algorithms: Hot Potato Routing Backward Learning Shortest Path Flooding Distance Vectors Link State Routing ____________ are/is distributed adaptive routing algorithms
Background image of page 9

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

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 10 CS 132 #4 Backward learning routing algorithm is not aware of network topology at the initial state? True
Background image of page 10
School of ICS, UC Irvine 11 CS 132 #5 slide 76 Initial Tables B-D becomes 10, trace next 3 iterations using Bellman-Ford 0 4 3 6 8 Distance to E 4 0 6 2 4 Distance to D 3 6 0 4 6 Distance to C 6 2 4 0 2 Distance to B 8 4 6 2 0 Distance to A Table at E Table at D Table at C Table at B Table at A A C B D 6 2 4 E 4 2 3
Background image of page 11

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

View Full DocumentRight Arrow Icon
School of ICS, UC Irvine 12 CS 132 #5 A C B D 6 2 4 E 4 10 3 0 4 3 6 8 Distance to E 4 0 6 2 6 4 Distance to D 3 6 0 4 6 Distance to C 6 2 4 0 2 Distance to B 8 4 6 2 0 Distance to A Table at E Table at D Table at C Table at B Table at A
Background image of page 12
Image of page 13
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 / 126

Homework3_Fall_2010_solutions - CS 132 Discussion HW3...

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

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