CHAPTER 11

Unicast Routing Protocols

(RIP, OSPF, and BGP)

Exercises
1. The expiration timer value is 6 times that of the periodic timer to allow for some
missed communication between routers.

3. In distance vector routing each router sends all of its knowledge about an autono-
mous system to all of the routers on its neighboring networks at regular intervals. It
uses a fairly simple algorithm to update the routing tables but results in a lot of
unneeded network traffic. In link state routing a router floods an autonomous sys-
tem with information about changes in a network only when changes occur. It uses
less network resources than distance vector routing in that it sends less traffic over
the network but it uses the much more complex Dijkstra’s Algorithm to calculate
routing tables from the link state database.

5.
a. The size of a RIP message that advertises a single network is 24 bytes.

b. The size of a RIP message that advertises N networks is (4 + 20 × N) bytes.

c. The general formula can be given as 4 + (20 × N)

1
 SECTION 2

7. See Figure 11.E7.

Figure 11.E7 Solution to Exercise 7

2 Version Reserved Header

Family: 2 All 0s

Network 1
net 1
All 0s
All 0s
4
Family: 2 All 0s

Network 2
net 2
All 0s
All 0s
2
Family: 2 All 0s

Network 3
net 3
All 0s
All 0s
1
Family: 2 All 0s

Network 4
net 4
All 0s
All 0s
5

9. The general header has two empty bytes (set to 0’s). Each advertisement section
has 10 empty bytes. This means we have 2 + (10 × N) empty bytes in a message
advertising N networks.

11. See Figure 11.E11.

Figure 11.E11 Solution to Exercise 11

2 4 64 2 4 64
IP address of router A IP address of router D
Area ID Area ID
Checksum Authentication type Checksum Authentication type
Authentication data Authentication data
1 1
Age: 0 Reserved 0 1 2 0 Reserved 0 1 2
IP address of router A IP address of router D
IP address of router A IP address of router D
Sequence number Sequence number
Checksum 36 Checksum 36
Network mask for N1 Network mask for N3
IP address of router A IP address of router D
IP address of router B IP address of router E
IP address of router C IP address of router F
Part a. Network advertisment for N1 Part b. Network advertisment for N3
 SECTION 3

13. Figure 11.E13 shows the autonomous system and the graphical representation. N3
and N4 are stub networks; N1, N2, N5, and N6 are transient networks..
Figure 11.E13 Solution to Exercise 13

N3

R5

N1 N7 N6 N4

R2 R4 R6

R1 R7

N2 N8 N5

R3 R8

a. Autonomous System
N3

R5

N1 N6 N4
R2 R4 R6

R1 R7

N2 N5
R3 R8
b. Graphical Representation

15. See Figure 11.E15. We have revised each routing table to shows the change.
Figure 11.E15 Solution to Exercise 15

A B C D E
Dest Cost Next Dest Cost Next Dest Cost Next Dest Cost Next Dest Cost Next
Net1 1 — Net1 3 C Net1 2 A Net1 2 A Net1 3 C
Net2 Net2 Net2 Net2 Net2
8
8

8
8

Net3 3 C Net3 1 — Net3 2 B Net3 4 A Net3 3 C

Net4 1 — Net4 3 C Net4 2 A Net4 1 — Net4 3 C
Net5 1 — Net5 2 C Net5 1 — Net5 2 A Net5 2 C
Net6 2 C Net6 1 — Net6 1 — Net6 3 A Net6 2 C
Net7 2 C Net7 2 C Net7 1 — Net7 3 A Net7 1 —
 SECTION 4

17. See Figure 11.E17. We have written a Java program based on the pseudocode
defined in the text to calculate the distances. The cost and the distances are repre-
sented as two dimensional tables. Rows are sources; columns are destinations.

Figure 11.E17 Solution to Exercise 17

4
A B 2
2 3 E

C D
5
Topology

A B C D E
A 0 4 2

8
8
B 4 0 3

8
8
C 2 0 5

8
D 8
3 5 0

8
8

E 2 0
8

Costs 8

A B C D E A B C D E
A 0 A 0 4 2
8
8
8
8

8
8
B 0 3 B 4 0 6 3
8

8
C 0 C 2 6 0 5
8
8

8
8

8
D 0 D 7 3 5 0
8
8
8
8

E 0 E 6 2 8 5 0
8
8
8
8

Initilized Distances Distances after

first iteration

A B C D E A B C D E
A 0 4 2 7 A 0 4 2 7
8

B 4 0 6 3 B 4 0 6 3
8

C 2 6 0 5 C 2 6 0 5
8

D 7 3 5 0 D 7 3 5 0
8

E 6 2 8 5 0 E 6 2 8 5 0
Distances after Final distances
second iteration
 SECTION 5

19. Figure 11.E19 shows how to find the shortest path tree for node B.

Figure 11.E19 Solution to Exercise 19

Legend

2 5 Root node
A B C 3
Node in the path
3 4 4 G
1
D E F Node not in the path
5 2
Path
Topology

2 0 5
A B C

8
D E F
4

8
8

Initialization

2 0 5 2 0 5
A B C A B C

G G
8

8
D E F D E F
5 4 5 4 6
8

Iteration 1 Iteration 2

2 0 5 2 0 5
A B C A B C

G G
8 8
D E F D E F
5 4 6 5 4 6
Iteration 3 Iteration 4

2 0 5 2 0 5
A B C A B C

G G
8
D E F D E F 7
5 4 6 5 4 6
Iteration 5 Iteration 6
 SECTION 6

21. Figure 11.E21 shows how to find the shortest path tree for node G.

Figure 11.E21 Solution to Exercise 21

2 5 Root node
A B C 3
Node in the path Legend
3 4 4 G
1
D E F Node not in the path
5 2
Path
Topology

8
A B C

D E F
1
8

8
Initialization

3 7 3

8
8

A B C A B C

G G

D E F D E F
1 8 3 1
8

Iteration 1 Iteration 2

7 3 9 7 3
8

A B C A B C

G G

D E F D E F
8 3 1 8 3 1
Iteration 3 Iteration 4

9 7 3 9 7 3
A B C A B C

G G

D E F D E F
8 3 1 8 3 1
Iteration 5 Iteration 6