
Routing and Routing Protocols
175
Node C would relay this message to D on link 3, which in turn would relay
the message to E on link 6 and B on link 4.
Similarly, node B would transmit an update message on links 4 and 5 to
nodes D and E as follows:
From B to A link 1, distance = infinite
Node D will relay the message to node C on link 3 and C would relay the
message to node A on link 2.
The previous database update examples do not consider the fact that it is
possible for a message to propagate through a network and inadvertently
update a node that was updated with more recent information. Thus, a delayed
update could adversely affect the information ...