Skip to main content

RFC 2328 - OSPF Version 2

发布日期 (Publication Date): 1998年4月 (April 1998)
状态 (Status): 标准跟踪协议 (Standards Track)
作者 (Author): J. Moy (Ascend Communications, Inc.)
废止 (Obsoletes): RFC 2178
STD: 54

摘要 (Abstract)​

本文档记录了 OSPF 协议版本 2 (This memo documents version 2 of the OSPF protocol). OSPF 是一种链路状态路由协议 (OSPF is a link-state routing protocol). 它被设计为在单个自治系统内部运行 (It is designed to be run internal to a single Autonomous System). 每个 OSPF 路由器维护一个描述自治系统拓扑的相同数据库 (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 在面对拓扑变化时能快速重新计算路由，并使用最少的路由协议流量 (OSPF recalculates routes quickly in the face of topological changes, utilizing a minimum of routing protocol traffic). OSPF 提供等价多路径支持 (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). 此外，所有 OSPF 路由协议交换都经过认证 (In addition, all OSPF routing protocol exchanges are authenticated).

本文档与 RFC 2178 之间的差异在附录 G 中说明，所有差异都是向后兼容的 (The differences between this memo and RFC 2178 are explained in Appendix G. All differences are backward-compatible in nature).

目录 (Table of Contents)​

主要章节 (Main Sections)​

  • 1. Introduction (简介)

    • 1.1 Protocol Overview (协议概述)
    • 1.2 Definitions of commonly used terms (常用术语定义)
    • 1.3 Brief history of link-state routing technology (链路状态路由技术简史)
    • 1.4 Organization of this document (文档组织)
    • 1.5 Acknowledgments (致谢)

  • 2. The Link-state Database (链路状态数据库)

    • 2.1 Representation of routers and networks (路由器和网络的表示)
    • 2.2 The shortest-path tree (最短路径树)
    • 2.3 Use of external routing information (外部路由信息的使用)
    • 2.4 Equal-cost multipath (等价多路径)

  • 3. Splitting the AS into Areas (将自治系统划分为区域)

    • 3.1 The backbone of the Autonomous System (自治系统的骨干网)
    • 3.2 Inter-area routing (区域间路由)
    • 3.3 Classification of routers (路由器分类)
    • 3.4 A sample area configuration (示例区域配置)
    • 3.5 IP subnetting support (IP子网支持)
    • 3.6 Supporting stub areas (末梢区域支持)
    • 3.7 Partitions of areas (区域分区)

  • 4. Functional Summary (功能总结)

    • 4.1 Inter-area routing (区域间路由)
    • 4.2 AS external routes (AS外部路由)
    • 4.3 Routing protocol packets (路由协议数据包)
    • 4.4 Basic implementation requirements (基本实现要求)
    • 4.5 Optional OSPF capabilities (可选OSPF能力)

  • 5. Protocol Data Structures (协议数据结构)

  • 6. The Area Data Structure (区域数据结构)

  • 7. Bringing Up Adjacencies (建立邻接关系)

    • 7.1 The Hello Protocol (Hello协议)
    • 7.2 The Synchronization of Databases (数据库同步)
    • 7.3 The Designated Router (指定路由器)
    • 7.4 The Backup Designated Router (备份指定路由器)
    • 7.5 The graph of adjacencies (邻接图)

  • 8. Protocol Packet Processing (协议数据包处理)

    • 8.1 Sending protocol packets (发送协议数据包)
    • 8.2 Receiving protocol packets (接收协议数据包)

  • 9. The Interface Data Structure (接口数据结构)

    • 9.1 Interface states (接口状态)
    • 9.2 Events causing interface state changes (导致接口状态变化的事件)
    • 9.3 The Interface state machine (接口状态机)
    • 9.4 Electing the Designated Router (选举指定路由器)
    • 9.5 Sending Hello packets (发送Hello数据包)

  • 10. The Neighbor Data Structure (邻居数据结构)

    • 10.1 Neighbor states (邻居状态)
    • 10.2 Events causing neighbor state changes (导致邻居状态变化的事件)
    • 10.3 The Neighbor state machine (邻居状态机)
    • 10.4 Whether to become adjacent (是否建立邻接)
    • 10.5 Receiving Hello Packets (接收Hello数据包)
    • 10.6 Receiving Database Description Packets (接收数据库描述数据包)
    • 10.7 Receiving Link State Request Packets (接收链路状态请求数据包)
    • 10.8 Sending Database Description Packets (发送数据库描述数据包)
    • 10.9 Sending Link State Request Packets (发送链路状态请求数据包)
    • 10.10 An Example (示例)

  • 11. The Routing Table Structure (路由表结构)

    • 11.1 Routing table lookup (路由表查找)
    • 11.2 Sample routing table, without areas (无区域的路由表示例)
    • 11.3 Sample routing table, with areas (有区域的路由表示例)

  • 12. Link State Advertisements (LSAs) (链路状态通告)

    • 12.1 The LSA Header (LSA头部)
    • 12.2 The link state database (链路状态数据库)
    • 12.3 Representation of TOS (TOS的表示)
    • 12.4 Originating LSAs (产生LSA)

  • 13. The Flooding Procedure (泛洪过程)

    • 13.1 Determining which LSA is newer (确定哪个LSA更新)
    • 13.2 Installing LSAs in the database (在数据库中安装LSA)
    • 13.3 Next step in the flooding procedure (泛洪过程的下一步)
    • 13.4 Receiving self-originated LSAs (接收自己产生的LSA)
    • 13.5 Sending Link State Acknowledgment packets (发送链路状态确认数据包)
    • 13.6 Retransmitting LSAs (重传LSA)
    • 13.7 Receiving link state acknowledgments (接收链路状态确认)

  • 14. Aging The Link State Database (链路状态数据库的老化)

    • 14.1 Premature aging of LSAs (LSA的过早老化)

  • 15. Virtual Links (虚拟链路)

  • 16. Calculation of the Routing Table (路由表的计算)

    • 16.1 Calculating the shortest-path tree for an area (计算区域的最短路径树)
    • 16.2 Calculating the inter-area routes (计算区域间路由)
    • 16.3 Examining transit areas' summary-LSAs (检查转发区域的汇总LSA)
    • 16.4 Calculating AS external routes (计算AS外部路由)
    • 16.5 Incremental updates -- summary-LSAs (增量更新--汇总LSA)
    • 16.6 Incremental updates -- AS-external-LSAs (增量更新--AS外部LSA)
    • 16.7 Events generated as a result of routing table changes (路由表变化产生的事件)
    • 16.8 Equal-cost multipath (等价多路径)

附录 (Appendices)​

Last updated on