Visual RFC.
ALL RFCs / RFC 2328
Read the RFC ↗
RFC 2328 / PROTOCOL MECHANISMS

Flood a newer link advertisement

03

Reliable flooding distributes newer link-state information through the area.

Related RFCs and changes

“Updates” changes part of an earlier RFC. “Obsoletes” replaces it. This list shows selected related documents.

DIAGRAM§ 13 ↗
RFC 2328 · § 13EXAMPLE
3 / 3
Flood a newer link advertisementReliable flooding distributes newer link-state information through the area.originneighbornext neighborLSA sequence n+1newer LSAfloodacknowledgeRemove from retransmission listCompare sequence, checksum, and age to select the LSA instance
03
Acknowledgment removes it from the retransmission list.

Acknowledgment removes it from the retransmission list.

Protocol participantThreat or exceptionProtocol controlSimplified drawings · precise section references
WHAT CHANGED
RFC 2178RFC 2328 Appendix G.1

MaxAge LSA handling is refined: immediate acknowledgment and discard requires no database copy and no neighbor in Exchange or Loading.

Read the updated RFC section ↗
KEY POINT

Sequence numbers, checksums, and age help decide which LSA instance is newer.

  • Sequence numbers, checksums, and age help decide which LSA instance is newer.
  • Acknowledgments and retransmission lists make flooding reliable.
DETAILS

The drawing is a simplified worked example. Follow the linked RFC and its updates for implementation requirements.

Read the RFC section ↗

Diagrams simplify the RFC. Read the linked sections for complete requirements.

Privacy
All chapters in this RFC
  1. Discover neighbors and form adjacencies
  2. Synchronize the link-state database
  3. Flood a newer link advertisement
  4. Compute a shortest-path tree
  5. Separate areas through the backbone
RFC 9700 / CHAPTERS

Chapters

For full details, tables, algorithms, and exceptions, read the original RFC.

RFC status and corrections ↗