1) What is Distance-Vector Routing Protocol?

 Distance vector routing protocols use the distance and direction (vector) to find paths to
destinations.
 A router which is running a Distance Vector routing protocol informs its neighbors about the
network topology changes periodically.

2) What is Link-State Routing Protocol?

 Each router running a link state routing protocol originates information about the router, its
directly connected links, and the state of those links. This information is sent to all the routers in
the network as multicast messages.
 Link-state routing always try to maintain full networks topology by updating itself incrementally
only whenever a change happens in network.

3) What are the Metrics for RIP protocol and OSPF protocol?

Protocol Metric Explanation

Number of routers (number of hops) from the source router through
RIP Hop Count
which data must pass to reach the destination network.
OSPF Cost Measurement in the inverse of the bandwidth of the links

4) A routing table has 20 entries. It does not receive information about six routes for 200
s. How many timers are running at this time?

The 21 timers are listed below: -

Periodic timer: 1
Expiration timer: 20 – 6 = 14
Garbage collection timer: 6

5) Consider this simple topology of count-to-infinity:

1 1
A B C

What is the value will the routing tables have when the system has stabilized (after many
rounds)?

i. Node A

A B
B 1
C 2
 ii. Node B

B A C
A 1 3
C 3 1

iii. Node C

C B
A 2
B 1

6) Given a network topology in the figure below:

1
B C
5 2

8 4
A F

1 E D
9

Notes: The number on each line is the cost of the line

i. Show the global distance vector table

Global distance vector table

Router Distance to each other
A B C D E F
A 0 5 ∞ ∞ 1 ∞
B 5 0 1 ∞ 8 ∞
C ∞ 1 0 4 ∞ 2
D ∞ ∞ 4 0 9 ∞
E 1 8 ∞ 9 0 ∞
F ∞ ∞ 2 ∞ ∞ 0
 ii. Show the routing table at node A (initialize).

Routing Table for Router A

Destination Distance Next Hop
B 5 -
C 6 B
D 10 E
E 1 -
F 8 B

Given a network topology in the figure below: -

5
A C

2 3 4

B D
9

7) Find the shortest path tree for node B

A C

2 3 4

B D

8) Find the shortest path tree for node C

5
A C

3 4

B D