RFC 2328 - OSPF Version 2
Publication Date: April 1998
Status: Standards Track
Author: J. Moy (Ascend Communications, Inc.)
Obsoletes: RFC 2178
STD: 54
Abstract
This memo documents version 2 of the OSPF protocol. OSPF is a link-state routing protocol. It is designed to be run internal to a single Autonomous System. Each OSPF router maintains an identical database describing the Autonomous System's topology. From this database, a routing table is calculated by constructing a shortest-path tree.
OSPF recalculates routes quickly in the face of topological changes, utilizing a minimum of routing protocol traffic. OSPF provides support for equal-cost multipath. An area routing capability is provided, enabling an additional level of routing protection and a reduction in routing protocol traffic. In addition, all OSPF routing protocol exchanges are authenticated.
Table of Contents
Main Sections
- 1. Introduction
- 2. The Link State Database
- 3. Splitting the AS into Areas
- 4. Functional Summary
- 5. Protocol Data Structures
- 6. The Area Data Structure
- 7. Bringing Up Adjacencies
- 8. Protocol Packet Processing
- 9. The Interface Data Structure
- 10. The Neighbor Data Structure
- 11. The Routing Table Structure
- 12. Link State Advertisements
- 13. The Flooding Procedure
- 14. Aging The Link State Database
- 15. Virtual Links
- 16. Calculation of the Routing Table
Appendices
- Appendix A. OSPF Data Formats
- Appendix B. Architectural Constants
- Appendix C. Configurable Constants
- Appendix D. Authentication
- Appendix E. An Algorithm for Assigning Link State IDs
- Appendix F. Multiple Interfaces to Same Network
- Appendix G. Differences from RFC 2178
Related Resources
- Official RFC: RFC 2328
- Datatracker: RFC 2328 Page