Scribd
Upload
254 views4 pages

Chapter 6 - 12 Questions

The document discusses different types of routing tables and routing protocols like RIP and OSPF. It provides explanations of routing concepts like distance vector routing versus link state routing, and solutions to problems like routing loops. Several examples are given using network diagrams to illustrate routing table updates and shortest path calculations using algorithms like Dijkstra and Bellman-Ford.

Uploaded by

maqyla naquel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
254 views4 pages

Chapter 6 - 12 Questions

The document discusses different types of routing tables and routing protocols like RIP and OSPF. It provides explanations of routing concepts like distance vector routing versus link state routing, and solutions to problems like routing loops. Several examples are given using network diagrams to illustrate routing table updates and shortest path calculations using algorithms like Dijkstra and Bellman-Ford.

Uploaded by

maqyla naquel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1) How many types of routing tables? Distinguish them.

- static vs dynamic routing

-A static table is one with manual entries. A dynamic table, on the other hand, is one that is updated
automatically when there is a change somewhere in the internet.

2) In RIP, why is the expiration timer value six times that of the periodic timer value?

-bcs during that time, it allows some missed communication between the routers

3) Distinguish distance vector routing with link state routing

Distance Vector Routing Comparison Link State Routing

Bellman Ford Algorithm Dijsktra

Based on the least number of


Best path calculation Based on the cost
hops

4) What is the best solution of routing loop problem? Explain.

- Split horizon : Enforces a rule which prevents the information form sending back to the source from
which it was received.

-Route poisoning : When any network goes down its router simulates the network as 16 in the table
entry (which is unreachable or infinite as only 15 hops are allowed).

5) A router using RIP has the routing table shown in table 1

Destination Cast Net Router

Net 1 1 A

Net 2 2 B

Net 3 3 C

Net 4 4 D

Show the RIP response message sent by this router

6) Construct a table to list all the RIP timers and its duration.
7) Construct the routing table for node B in figure 1 using the shortest path tree protocol in OSPF

4
C D
A
2 3 1 F
E
B

1 2 3 5

G
H

4 1

1 2 6

Figure 1

8) By using the same figure above, find the shortest path for node G

9) Use Dijkstra algorithm to find the shortest paths for all nodes in the graphs of figure 2

A 4 B

2 D
E
2 1 3
F C
5

Figure 2

10) Use the Bellman-Ford algorithm to find the shortest distances for all nodes in the graphs of figure 3

A B

b
2
D
5 1 2

E
C
3

Figure 3

11) One solution to the count-to-infinity problem is “poison-reverse”:if you are currently routing
through a neighbor, tell that neighbor that your path to the destination has infinite cost.

Refer to figure 4, suppose the link between B and D goes down. B notices this change and sends an
update to A. what is A’s routing table after processing B’s update?

1
B

A C

1 1
1

Figure 4

Before processing
After Processing
(A) B C

B 1 2 (A) B C

C 2 1 B 1 2

D 2 3 C 2 1

D ∞ 3

12) By refer to the figure 4, what happen to the routing table for node B, when A sends an update
back to B? Show the process.

Before Processing After Processing

(B) A C D (B) A C D

A 1 2 ∞ A 1 2 ∞

C 2 1 ∞ C 2 1 ∞

D ∞ ∞ 1 D 4 ∞ ∞

You might also like