OSPF - rfc1583 - Network Working Group Request for Comments...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Network Working Group J. Moy Request for Comments: 1583 Proteon, Inc. Obsoletes: 1247 March 1994 Category: Standards Track OSPF Version 2 Status of this Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the “Internet Official Protocol Standards” (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. 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. Separate routes can be calculated for each IP Type of Service. 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. OSPF Version 2 was originally documented in RFC 1247. The differences between RFC 1247 and this memo are explained in Appendix E. The differences consist of bug fixes and clarifications, and are backward-compatible in nature. Implementations of RFC 1247 and of this memo will interoperate. Please send comments to [email protected] Contents 1 Introduction 1 1.1 Protocol overview 1 1.2 Definitions of commonly used terms 2 1.3 Brief history of link-state routing technology 3 1.4 Organization of this document 3 2 The Topological Database 3 2.1 The shortest-path tree 6 2.2 Use of external routing information 6 2.3 Equal-cost multipath 11 2.4 TOS-based routing 11
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
RFC 1583 OSPF Version 2 March 1994 3 Splitting the AS into Areas 12 3.1 The backbone of the Autonomous System 12 3.2 Inter-area routing 12 3.3 Classification of routers 13 3.4 A sample area configuration 13 3.5 IP subnetting support 17 3.6 Supporting stub areas 18 3.7 Partitions of areas 19 4 Functional Summary 20 4.1 Inter-area routing 20 4.2 AS external routes 20 4.3 Routing protocol packets 21 4.4 Basic implementation requirements 21 4.5 Optional OSPF capabilities 23 5 Protocol Data Structures 23 6 The Area Data Structure 24 7 Bringing Up Adjacencies 27 7.1 The Hello Protocol 27 7.2 The Synchronization of Databases 27 7.3 The Designated Router 28 7.4 The Backup Designated Router 28 7.5 The graph of adjacencies 29 8 Protocol Packet Processing 29 8.1 Sending protocol packets 31 8.2 Receiving protocol packets 32 9 The Interface Data Structure 33 9.1 Interface states 35 9.2 Events causing interface state changes 36 9.3 The Interface state machine 37 9.4 Electing the Designated Router 38 9.5 Sending Hello packets 40 9.5.1 Sending Hello packets on non-broadcast networks 40 Moy [Page ii]
Background image of page 2
RFC 1583 OSPF Version 2 March 1994 10 The Neighbor Data Structure 41 10.1 Neighbor states 42 10.2 Events causing neighbor state changes
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/13/2010 for the course CITX CITX 1150 taught by Professor P.whalen during the Fall '09 term at British Columbia Institute of Technology.

Page1 / 132

OSPF - rfc1583 - Network Working Group Request for Comments...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online