1.Consider the network in Figure 4.52, 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, and 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.
2.Suppose that nodes in the network shown in Figure 4.55 participate in link-state
routing, and C receives contradictory LSPs: One from A arrives claiming the A–B
link is down, but one from B arrives claiming the A–B link is up.
(a) How could this happen?
(b) What should C do? What can C expect?
Do not assume that LSPs contain any synchronized timestamp.
mong các a chị giúp đỡ.thanks all
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, and 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.
2.Suppose that nodes in the network shown in Figure 4.55 participate in link-state
routing, and C receives contradictory LSPs: One from A arrives claiming the A–B
link is down, but one from B arrives claiming the A–B link is up.
(a) How could this happen?
(b) What should C do? What can C expect?
Do not assume that LSPs contain any synchronized timestamp.
mong các a chị giúp đỡ.thanks all
Comment