hw4_sol - Next_Hop A 2 A B 3 A C--D 2 D/E E 1 E For Node D...

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

View Full Document Right Arrow Icon
HW 5 Reference Solution Q1. Solution: a) The initial routing tables of 5 nodes are listed as follows: For Node A Destination Distance Next_Hop A 0 -- B 1 B C 4 C D -- -- E -- -- For Node B Destination Distance Next_Hop A 1 A B 0 -- C -- -- D 3 D E -- -- For Node C Destination Distance Next_Hop A 2 A B -- -- C 0 -- D 2 D E 1 E For Node D Destination Distance Next_Hop A -- -- B 2 B C 1 C D 0 -- E 1 E For Node E Destination Distance Next_Hop A -- -- B -- -- C 2 C
Background image of page 1

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

View Full DocumentRight Arrow Icon
D 1 D E 0 -- b) After 1 st update the routing tables are For Node A Destination Distance Next_Hop A 0 -- B 1 B C 4 C D 4 B E 5 C For Node B Destination Distance Next_Hop A 1 A B 0 -- C 4 D D 3 D E 4 D For Node C Destination Distance Next_Hop A 2 A B 3 A C 0 -- D 2 D E 1 E For Node D Destination Distance Next_Hop A 3 B/C B 2 B C 1 C D 0 -- E 1 E For Node E Destination Distance Next_Hop A 4 C B 3 D C 2 C/D
Background image of page 2
D 1 D E 0 -- After 2 nd update the routing tables are For Node A Destination Distance Next_Hop A 0 -- B 1 B C 4 C D 4 B E 5 B/C For Node B Destination Distance Next_Hop A 1 A B 0 -- C 4 D D 3 D E 4 D For Node C Destination Distance
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Next_Hop A 2 A B 3 A C--D 2 D/E E 1 E For Node D Destination Distance Next_Hop A 3 B/C B 2 B C 1 C D--E 1 E For Node E Destination Distance Next_Hop A 4 C/D B 3 D C 2 C/D D 1 D E--After 3 rd update the routing tables are not changed. Notice: When there are multiple available choices for the next hop, either one is correct. Q2. Solution: The first four steps of Dijkstra algorithm is shown as follows: step N D(B),p(B) D(C),p(C) D(D),p(D) D(E),p(E) D(F),p(F) D(G),p(G) D(H),p(H A 1,A 3,A 2,A--------1 AB 3,A 2,A------5,B 2 ABD 3,A 3,D----3,D 3 ABDC 3,D 6,C--3,D Notice: There are also other solutions....
View Full Document

Page1 / 4

hw4_sol - Next_Hop A 2 A B 3 A C--D 2 D/E E 1 E For Node D...

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

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