CHAPTER 21

Unicast and Multicast Routing:

Routing Protocols

Review Questions
1. In unicast routing one source sends to one destination. In multicast routing
one source sends to a group of destinations.
3. An interior routing protocol such as RIP handles routing inside an autono-
mous system. An exterior routing protocol such as BGP handles routing
between autonomous systems.
5. Point-to-point, transient, stub, and virtual.
7. A Link State Advertisement announces the states of entity links.
9. The Dijkstra algorithm calculates the shortest path between two points on a
network. OSPF, a unicast routing protocol, uses link state routing, which is
based on the Dijkstra algorithm.
11. Source-based tree: a single tree is made from each combination of source
and group.
Group-shared tree: each group in the system shares the same tree.
13. MBONE enables multicasting for isolated routers using the concept of tun-
neling.

Multiple-Choice Questions
15. d
17. d
19. a
21. c
23. b
25. d
27. d
29. a
31. b

1
2 CHAPTER 21 UNICAST AND MULTICAST ROUTING: ROUTING PROTOCOLS

33. d
35. c
37. b
39. d
41. d
43. d
45. b (the second is a backup)
47. b
49. d
51. d
53. d
55. d
57. b
59. c
61. b
63. a

Exercises
65. The basis for classification of networks in OSPF is correlated to the number of
routers connected to the network.
67. See Figure 21.1.
69. net1 3 C
net2 2 C
net3 1 F
net4 5 G
71. See Figure 21.2.
73. There is no need for a report message to travel outside of its own network because
its only purpose is to inform the next higher router in the spanning tree of group
membership. There is no need for a query message to travel outside of the local
network because its only purpose is to poll the local network for membership in
any groups.
75. A router should send only 1 query message no matter how many entries it has in its
group table. The message will be broadcast to all of the local nodes that are below
it in the spanning tree.
77. See Figure 21.3
79. The router will not need the services of ARP because the frame is broadcast at the
physical address level. See Figure 21.4
81. It should set the state of the 2 entries to Delaying and start a timer for each with a
random time. As each timer expires, a report message should be sent for the corre-
sponding membership to the router that sent the query. See Figure 21.5.
 SECTION 3

Figure 21.1 Exercise 67

Receive Message

For each advertised

Destination

Increment
hop count

false If already true

in table

false If next hop true

is the same

false If advertised true

hop count smaller

Add to table Replace old entry Replace old entry

with new entry with new entry

Done

Figure 21.2 Exercise 71

N3

R5

R2 R4 R6
N1 N7 N4
N6

R1 R7

N8
N2 N5
R3 R8

83. When the router receives the report from the host, it should create a new entry in
its group table setting the state for the group to Delaying. It should also set a timer.
When the timer expires, it should send a report message to the next higher router in
the spanning tree. See Figure 21.6.
85. Destination: 10.0.0.0
Interface: 2
4 CHAPTER 21 UNICAST AND MULTICAST ROUTING: ROUTING PROTOCOLS

Figure 21.3 Exercise 77

0x11 100 0xEE9B

Figure 21.4 Exercise 79

Length of IP
4 5 0 header plus data

1 0 0

Time to live Protocol Checksum

185.23.5.6

226.17.18.4

Data

a. Datagram

Datagram from part a

0xAAA...A 2
0xAB 0x01005E111204 0x4A224512E1E2
(14 As)
Preamble SFD Destination addr. Source addr. Type Data CRC
b. Frame

Figure 21.5 Exercise 81

0x16 0 0x03F4

227.4.3.7

0x16 0 0xFEBA

229.45.6.23

87. No, RPF does not create a spanning tree because a network can receive more than
one copy of the same multicast packet. RPF creates a graph instead of a tree.
89. Yes, RPM creates a spanning tree because it is actually RPB (see previous answer)
with pruning and grafting features. The leaves of the tree are the networks.
 SECTION 5

Figure 21.6 Exercise 83

0x16 0 0xF7A6

232.54.10.34
6 CHAPTER 21 UNICAST AND MULTICAST ROUTING: ROUTING PROTOCOLS