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

Discover neighbors and form adjacencies

01

Hello exchanges discover neighbors, but not every neighbor pair needs a full adjacency.

Related RFCs and changes

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

DIAGRAM§ 7 ↗
RFC 2328 · § 7EXAMPLE
3 / 3
Discover neighbors and form adjacenciesHello exchanges discover neighbors, but not every neighbor pair needs a full adjacency.R1R2R3broadcast linkHelloHello / sees R1designated routerNeighbor discovery does not imply every pair needs full adjacency
03
Choose the needed full adjacencies, including designated-router relationships.

Choose the needed full adjacencies, including designated-router relationships.

Protocol participantThreat or exceptionProtocol controlSimplified drawings · precise section references
KEY POINT

Matching key network parameters and bidirectional recognition matter.

  • Matching key network parameters and bidirectional recognition matter.
  • On a broadcast network the designated router and backup reduce adjacency overhead.
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 ↗