UNLIMITED FREE
ACCESS TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Select Your Free Newsletters

Industry Newsletters

Select Your Free Product Alerts

Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

IETF RFC 3101

The OSPF Not-So-Stubby Area (NSSA) Option

active, Most Current
Buy Now
Organization: IETF
Publication Date: 1 January 2003
Status: active
Page Count: 33
scope:

This memo documents an optional type of Open Shortest Path First (OSPF) area that is somewhat humorously referred to as a "not-sostubby" area (or NSSA). NSSAs are similar to the existing OSPF stub area configuration option but have the additional capability of importing AS external routes in a limited fashion.

The OSPF NSSA Option was originally defined in RFC 1587. The functional differences between this memo and RFC 1587 are explained in Appendix F. All differences, while expanding capability, are backward-compatible in nature. Implementations of this memo and of RFC 1587 will interoperate.

Document History

IETF RFC 3101
January 1, 2003
The OSPF Not-So-Stubby Area (NSSA) Option
This memo documents an optional type of Open Shortest Path First (OSPF) area that is somewhat humorously referred to as a "not-sostubby" area (or NSSA). NSSAs are similar to the existing OSPF stub...

References

This document is referenced by:
IETF RFC 4750 - OSPF Version 2 Management Information Base
Published by IETF on December 1, 2006
This memo defines a portion of the Management Information Base (MIB) for use with network management protocols in TCP/IP-based internets. In particular, it defines objects for managing version 2 of...
This document is referenced by:
IETF RFC 7684 - OSPFv2 Prefix/Link Attribute Advertisement
Published by IETF on November 1, 2015
OSPFv2 requires functional extension beyond what can readily be done with the fixed-format Link State Advertisements (LSAs) as described in RFC 2328. This document defines OSPFv2 Opaque LSAs based on...
This document is referenced by:
IETF RFC 8666 - OSPFv3 Extensions for Segment Routing
Published by IETF on December 1, 2019
Abstract Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological subpaths called "segments". These segments are...
This document is referenced by:
IETF RFC 8665 - OSPF Extensions for Segment Routing
Published by IETF on December 1, 2019
Abstract Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological subpaths called "segments". These segments are...
This document is referenced by:
IETF RFC 8770 - Host Router Support for OSPFv2
Published by IETF on April 1, 2020
Abstract The Open Shortest Path First Version 2 (OSPFv2) protocol does not have a mechanism for a node to repel transit traffic if it is on the shortest path. This document defines a bit called the...
This document is referenced by:
RFC 9084 - OSPF Prefix Originator Extensions
Published by IETF on August 1, 2021
Abstract This document defines OSPF extensions to include information associated with the node originating a prefix along with the prefix advertisement. These extensions do not change the core OSPF...
This document is referenced by:
RFC 9067 - A YANG Data Model for Routing Policy
Published by IETF on October 1, 2021
Abstract This document defines a YANG data model for configuring and managing routing policies in a vendor-neutral way. The model provides a generic routing policy framework that can be extended for...
This document is referenced by:
RFC 9129 - YANG Data Model for the OSPF Protocol
Published by IETF on October 1, 2022
This document defines a YANG data model that can be used to configure and manage OSPF. The model is based on YANG 1.1 as defined in RFC 7950 and conforms to the Network Management Datastore...
This document is referenced by:
RFC 9350 - IGP Flexible Algorithm
Published by IETF on February 1, 2023
IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE)...
View Less
View All
Advertisement