Consider the network in Figure 3.56, using link-state routing. Suppose the B–F link fails, and the following then occur in sequence:

(a) Node H is added to the right side with a connection to G.

(b) Node D is added to the left side with a connection to C.

(c) A new link D–A is added.

The failed B–F link is now restored. Describe what link-state packets will flood back and forth. Assume that the initial sequence number at all nodes is 1, that no packets time out, and that both ends of a link use the same sequence number in their LSP for that link, greater than any sequence number either used before.

Figure 3.56)

Transcribed Image Text:

(>> A B) (F) G