 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Strategy:
Send to all nodes (not just neighbors) information
|
|
about
directly connected links (not entire routing table).
|
|
|
| n |
Link
State Packet (LSP)
|
|
|
|
– |
id of
the node that created the LSP
|
|
|
– |
cost
of link to each directly connected neighbor
|
|
|
|
– |
sequence
number (SEQNO)
|
|
|
– |
time-to-live
(TTL) for this packet
|
|
|
| n |
Reliable
Flooding
|
|
|
|
– |
store
most recent LSP from each node
|
|
|
– |
forward
LSP to all nodes but one that sent it
|
|
|
|
– |
generate
new LSP periodically; increment SEQNO
|
|
|
|
– |
start
SEQNO at 0 when reboot
|
|
|
– |
decrement
TTL of each stored LSP; discard when TTL=0
|
|
