-
8/3/2019 Asmt3 Due Nov25
1/4
Computing Science DepartmentRandy J. Fortier
Course: COMP 3270 Assignment: #3Weight: 6% Date due: Nov. 25,
2011
Part 1: Distance Vector RoutingFigure 3.1 shows a network
topology. The lettered devices are routers. Your job for this part
is to use distance vectortechniques to populate the routing table
for the router C, by calculating the shortest distance to all other
routers (as
determined by distance vector protocols, of course). Your answer
will go into table 3.2, which is a rough estimate of a
routing table.
Figure 3.1 The network topology for part 1
Note: This question is simplified by treating all LAN segments
as equal-cost. This is obviously not true in the real
world, but it makes this question a bit easier. The number of
hops is the number of routers between C and the
destination router (including the destination router).
Note: The labels 'e0', 'e1', and 'e2' are labels for the
interfaces (presume that 'e' stands for Ethernet) for the router
C.
Use these in the 'Interface' column below.
Note: If there are any equal-cost paths (i.e. exactly the same
distance), include them all in the table (comma-separated).
However, do not include less-than-optimal paths.
1
-
8/3/2019 Asmt3 Due Nov25
2/4
Router Distance (Hops) Interface(s)
A
B
D
E
F
G
H
I
J
K
Table 3.2 The routing table for C (Distance Vector)
Note: There is no need (in this part) to show your work. The
final answers in the above table is adequate.
2
-
8/3/2019 Asmt3 Due Nov25
3/4
Part 2: Link State RoutingThis part is similar to part 1, except
that you are expected to use link state protocols to determine the
routing table.
The answers for this part will be more comprehensive. You must
include the PATH data structure in the blank space
that follows, and fill in the routing table in table 3.4. The
network topology (with link costs added) is shown in figure
3.3.
Figure 3.3: The network topology for part 2
PATH Data Structure:
3
-
8/3/2019 Asmt3 Due Nov25
4/4
Note: The labels 'e0', 'e1', and 'e2' are labels for the
interfaces (presume that 'e' stands for Ethernet) for the router
C.
Use these in the 'Interface' column below.
Note: If there are any equal-cost paths (i.e. exactly the same
distance), include them all in the table (comma-
separated). However, do not include less-than-optimal paths.
Note: It is recommended that you complete this question on a
separate sheet of paper, and copy the final PATH and
routing table here, since mistakes may make the table/PATH
difficult to read, which may cost you marks.
Router Distance (Total Cost) Interface(s)
A
B
D
E
F
G
HI
J
K
Table 3.4 The routing table for C (Link State)
4
