Open Shortest Path First

Last updated

Open Shortest Path First
Communication protocol
Purpose Routing protocol
Introduction1989;35 years ago (1989)
RFC(s) 1131, 1247, 1583, 2178, 2328, 3101, 5709, 6549, 6845...
OSPF for IPv6
Communication protocol
Introduction1999;25 years ago (1999)
RFC(s) 2740, 5340, 6845, 6860, 7503, 8362...

Open Shortest Path First (OSPF) is a routing protocol for Internet Protocol (IP) networks. It uses a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs), operating within a single autonomous system (AS).

Contents

OSPF gathers link state information from available routers and constructs a topology map of the network. The topology is presented as a routing table to the internet layer for routing packets by their destination IP address. OSPF supports Internet Protocol version 4 (IPv4) and Internet Protocol version 6 (IPv6) networks and is widely used in large enterprise networks. IS-IS, another LSR-based protocol, is more common in large service provider networks.

Originally designed in the 1980s, OSPF version 2 is defined in RFC 2328 (1998). [1] The updates for IPv6 are specified as OSPF version 3 in RFC 5340 (2008). [2] OSPF supports the Classless Inter-Domain Routing (CIDR) addressing model.

Concepts

OSPF is an interior gateway protocol (IGP) for routing Internet Protocol (IP) packets within a single routing domain, such as an autonomous system. It gathers link state information from available routers and constructs a topology map of the network. The topology is presented as a routing table to the internet layer which routes packets based solely on their destination IP address.

OSPF detects changes in the topology, such as link failures, and converges on a new loop-free routing structure within seconds. [3] It computes the shortest-path tree for each route using a method based on Dijkstra's algorithm. The OSPF routing policies for constructing a route table are governed by link metrics associated with each routing interface. Cost factors may be the distance of a router (round-trip time), data throughput of a link, or link availability and reliability, expressed as simple unitless numbers. This provides a dynamic process of traffic load balancing between routes of equal cost.

OSPF divides the network into routing areas to simplify administration and optimize traffic and resource utilization. Areas are identified by 32-bit numbers, expressed either simply in decimal, or often in the same octet-based dot-decimal notation used for IPv4 addresses. By convention, area 0 (zero), or 0.0.0.0, represents the core or backbone area of an OSPF network. While the identifications of other areas may be chosen at will, administrators often select the IP address of a main router in an area as the area identifier. Each additional area must have a connection to the OSPF backbone area. Such connections are maintained by an interconnecting router, known as an area border router (ABR). An ABR maintains separate link-state databases for each area it serves and maintains summarized routes for all areas in the network.

OSPF runs over IPv4 and IPv6, but does not use a transport protocol such as UDP or TCP. It encapsulates its data directly in IP packets with protocol number 89. This is in contrast to other routing protocols, such as the Routing Information Protocol (RIP) and the Border Gateway Protocol (BGP). OSPF implements its own transport error detection and correction functions. OSPF also uses multicast addressing for distributing route information within a broadcast domain. It reserves the multicast addresses 224.0.0.5 (IPv4) and ff02::5 (IPv6) for all SPF/link state routers (AllSPFRouters) and 224.0.0.6 (IPv4) and ff02::6 (IPv6) for all Designated Routers (AllDRouters). [1] :185 [2] :57 For non-broadcast networks, special provisions for configuration facilitate neighbor discovery. [1] OSPF multicast IP packets never traverse IP routers, they never travel more than one hop. The protocol may therefore be considered a link layer protocol, but is often also attributed to the application layer in the TCP/IP model. It has a virtual link feature that can be used to create an adjacency tunnel across multiple hops. OSPF over IPv4 can operate securely between routers, optionally using a variety of authentication methods to allow only trusted routers to participate in routing. OSPFv3 (IPv6) relies on standard IPv6 protocol security (IPsec), and has no internal authentication methods.

For routing IP multicast traffic, OSPF supports the Multicast Open Shortest Path First (MOSPF) protocol. [4] Cisco does not include MOSPF in their OSPF implementations. [5] Protocol Independent Multicast (PIM) in conjunction with OSPF or other IGPs, is widely deployed.

OSPF version 3 introduces modifications to the IPv4 implementation of the protocol. [2] Except for virtual links, all neighbor exchanges use IPv6 link-local addressing exclusively. The IPv6 protocol runs per link, rather than based on the subnet. All IP prefix information has been removed from the link-state advertisements and from the hello discovery packet making OSPFv3 essentially protocol-independent. Despite the expanded IP addressing to 128 bits in IPv6, area and router Identifications are still based on 32-bit numbers.

Router relationships

Network types (OSPFv2)
Network typePoint to point (P2P)Broadcast (default)Non-broadcast multi-access (NBMA)Point to multipointPoint to multipoint non broadcast (P2MP-NB)Passive
Max routers per network2UnlimitedUnlimitedUnlimitedUnlimitedna
Full mesh assumedYesYesYesNoNona
Hello (default Cisco)1010303030na
Dead timers (default Cisco)4040120120120na
Wait timer:0equal to dead timerequal to dead timer00na
Automatic neighbour discoveryYesYesNoYesNona
Discovery and hellos are sent to224.0.0.5224.0.0.5Neighbour IP224.0.0.5Neighbour IPna
Neighbour communication is sent to224.0.0.5 Unicast Unicast Unicast Unicast na
LSAs are sent to:224.0.0.5DR/BDR: 224.0.0.6
All: 224.0.0.5
DR/BDR: 224.0.0.6
All: 224.0.0.5
Unicast Unicast na
Next-hop IP:PeerOriginal routerOriginal routerHubHubna
Imported in to OSPF as:Stub and P2PTransitTransitStub and P2PStub and P2PStub

OSPF supports complex networks with multiple routers, including backup routers, to balance traffic load on multiple links to other subnets. Neighboring routers in the same broadcast domain or at each end of a point-to-point link communicate with each other via the OSPF protocol. Routers form adjacencies when they have detected each other. This detection is initiated when a router identifies itself in a hello protocol packet. Upon acknowledgment, this establishes a two-way state and the most basic relationship. The routers in an Ethernet or Frame Relay network select a designated router (DR) and a backup designated router (BDR) which act as a hub to reduce traffic between routers. OSPF uses both unicast and multicast transmission modes to send "hello" packets and link-state updates.

As a link-state routing protocol, OSPF establishes and maintains neighbor relationships for exchanging routing updates with other routers. The neighbor relationship table is called an adjacency database. Two OSPF routers are neighbors if they are members of the same subnet and share the same area ID, subnet mask, timers and authentication. In essence, OSPF neighborship is a relationship between two routers that allow them to see and understand each other but nothing more. OSPF neighbors do not exchange any routing information  the only packets they exchange are hello packets. OSPF adjacencies are formed between selected neighbors and allow them to exchange routing information. Two routers must first be neighbors and only then, can they become adjacent. Two routers become adjacent if at least one of them is designated router or backup designated router (on multiaccess-type networks), or they are interconnected by a point-to-point or point-to-multipoint network type. For forming a neighbor relationship between, the interfaces used to form the relationship must be in the same OSPF area. While an interface may be configured to belong to multiple areas, this is generally not practiced. When configured in a second area, an interface must be configured as a secondary interface.

Operation modes

The OSPF can have different operation modes on the following setups on an interface or network:

Indirect connections

Virtual link over Virtual links, tunneling and sham links, are a form of connections that goes over the routing engine, and is not a direct connection to the remote host.

  • Virtual links: The packets are sent as unicast. Can only be configured on a non-backbone area (but not stub-area). Endpoints need to be ABR, the virtual links behave as unnumbered point-to-point connections. The cost of an intra-area path between the two routers is added to the link.
  • Virtual link over tunneling (like GRE and WireGuard): Since OSPF does not support virtual links for areas other than the backbone, a workaround is to use of tunneling. [6] If the same IP or router ID is used, the link creates two equal-cost routes to the destination. [7]
  • Sham link [8] : [9] [10] An intra-area link that connects two sites via the MPLS VPN backbone that is preferred to an internal intra-area "OSPF backdoor link" between the same two sites. A sham link is only needed if the MPLS VPN backbone is preferred over the OSPF backdoor link.

Adjacency state machine

Each OSPF router within a network communicates with other neighboring routers on each connecting interface to establish the states of all adjacencies. Every such communication sequence is a separate conversation identified by the pair of router IDs of the communicating neighbors. RFC 2328 specifies the protocol for initiating these conversations (Hello Protocol) and for establishing full adjacencies (database description packets, link-state request packets). During its course, each router conversation transitions through a maximum of eight conditions defined by a state machine: [1] [11]

Neighbor state changes

Neighbor state changes (Hello Protocol) OSPF-Adjacency-process.drawio.png
Neighbor state changes (Hello Protocol)
  1. Down: The state down represents the initial state of a conversation when no information has been exchanged and retained between routers with the Hello Protocol.
  2. Attempt: The attempt state is similar to the down state, except that a router is in the process of efforts to establish a conversation with another router, but is only used on non-broadcast multiple-access networks (NBMAs).
  3. Init: The init state indicates that a hello packet has been received from a neighbor, but the router has not established a two-way conversation.
  4. Two-way: The two-way state indicates the establishment of a bidirectional conversation between two routers. This state immediately precedes the establishment of adjacency. This is the lowest state of a router that may be considered as a DR.

Database exchange

Neighbor state changes (database exchange) OSPF-Adjacency-process-Neighbor state changes (Database Exchange).drawio.png
Neighbor state changes (database exchange)
  1. Exchange start (exstart): The exstart state is the first step of adjacency of two routers.
  2. Exchange: In the exchange state, a router is sending its link-state database information to the adjacent neighbor. At this state, a router can exchange all OSPF routing protocol packets.
  3. Loading: In the loading state, a router requests the most recent link-state advertisements (LSAs) from its neighbor discovered in the previous state.
  4. Full: The full state concludes the conversation when the routers are fully adjacent, and the state appears in all router- and network-LSAs. The link-state databases of the neighbors are fully synchronized.

Broadcast networks

In broadcast multiple-access networks, neighbor adjacency is formed dynamically using multicast hello packets to 224.0.0.5.

IP 192.0.2.1 > 224.0.0.5: OSPFv2, hello IP 192.0.2.2 > 224.0.0.5: OSPFv2, hello IP 192.0.2.1 > 192.0.2.2: OSPFv2, database description IP 192.0.2.2 > 192.0.2.1: OSPFv2, database description

Passive network

A network where OSPF adverts the network, but the OSPF will not start neighbour adjacency.

Non-broadcast networks

In a non-broadcast multiple-access (NBMA) network, a neighbor adjacency is formed by sending unicast packets to another router. A non-broadcast network can have more than two routers, but broadcast is not supported.

IP 192.0.2.1 > 192.0.2.2: OSPFv2, hello IP 192.0.2.2 > 192.0.2.1: OSPFv2, hello IP 192.0.2.1 > 192.0.2.2: OSPFv2, database description IP 192.0.2.2 > 192.0.2.1: OSPFv2, database description

Examples of non-broadcast networks:


OSPF areas

A network is divided into OSPF areas that are logical groupings of hosts and networks. An area includes its connecting router having an interface for each connected network link. Each router maintains a separate link-state database for the area whose information may be summarized towards the rest of the network by the connecting router. Thus, the topology of an area is unknown outside the area. This reduces the routing traffic between parts of an autonomous system.

OSPF can handle thousands of routers with more a concern of reaching capacity of the forwarding information base (FIB) table when the network contains lots of routes and lower-end devices. [12] Modern low-end routers have a full gigabyte of RAM, [13] which allows them to handle many routers in an area 0. Many resources [14] refer to OSPF guides from over 20 years ago where it was impressive to have 64 MB of RAM.

Areas are uniquely identified with 32-bit numbers. The area identifiers are commonly written in the dot-decimal notation, familiar from IPv4 addressing. However, they are not IP addresses and may duplicate, without conflict, any IPv4 address. The area identifiers for IPv6 implementations (OSPFv3) also use 32-bit identifiers written in the same notation. When dotted formatting is omitted, most implementations expand area 1 to the area identifier 0.0.0.1, but some have been known to expand it as 1.0.0.0.[ citation needed ]

Several vendors (Cisco, Allied Telesis, Juniper, Alcatel-Lucent, Huawei, Quagga), implement totally stubby and NSSA totally stubby area for stub and not-so-stubby areas. Although not covered by RFC standards, they are considered by many to be standard features in OSPF implementations.

OSPF defines several area types:

Backbone area

Example of backbone, area 0 with 2 routers, R1 and R2 OSPF-area0 standalone figur.drawio.png
Example of backbone, area 0 with 2 routers, R1 and R2

The backbone area (also known as area 0 or area 0.0.0.0) forms the core of an OSPF network. All other areas are connected to it, either directly or through other routers. OSPF requires this to prevent routing loops. [15] Inter-area routing happens via routers connected to the backbone area and to their own associated areas. It is the logical and physical structure for the 'OSPF domain' and is attached to all nonzero areas in the OSPF domain. In OSPF the term autonomous system boundary router (ASBR) is historic, in the sense that many OSPF domains can coexist in the same Internet-visible autonomous system, RFC 1996. [16] [17]

All OSPF areas must connect to the backbone area. This connection, however, can be through a virtual link. For example, assume area 0.0.0.1 has a physical connection to area 0.0.0.0. Further assume that area 0.0.0.2 has no direct connection to the backbone, but this area does have a connection to area 0.0.0.1. Area 0.0.0.2 can use a virtual link through the transit area 0.0.0.1 to reach the backbone. To be a transit area, an area has to have the transit attribute, so it cannot be stubby in any way.

Regular area

Figure show 3 routers with 2 areas, area 0 and area 122, sharing one router. OSPF-area0 area122 mutliarea figur.drawio.png
Figure show 3 routers with 2 areas, area 0 and area 122, sharing one router.

A regular area is just a non-backbone (nonzero) area without specific feature, generating and receiving summary and external LSAs. The backbone area is a special type of such area.

Stub area

OSPF-stubby area figur.drawio.png
In hello packets the E-flag is not high, indicating "External routing: not capable"

A stub area is an area that does not receive route advertisements external to the AS and routing from within the area is based entirely on a default route. An ABR deletes type 4 and 5 LSAs from internal routers, sends them a default route of 0.0.0.0 and turns itself into a default gateway. This reduces LSDB and routing table size for internal routers.

Modifications to the basic concept of stub area have been implemented by systems vendors, such as the totally stubby area (TSA) and the not-so-stubby area (NSSA), both an extension in Cisco Systems routing equipment.

Totally stubby area

OSPF-Totally stubby area figur.drawio.png

A totally stubby area is similar to a stub area. However, this area does not allow summary routes in addition to not having external routes, that is, inter-area (IA) routes are not summarized into totally stubby areas. The only way for traffic to get routed outside the area is a default route which is the only Type-3 LSA advertised into the area. When there is only one route out of the area, fewer routing decisions have to be made by the route processor, which lowers system resource utilization.

Occasionally, it is said that a TSA can have only one ABR. [18]

Not-so-stubby area

OSPF-NSSA figur.drawio.png
In hello packets the N-flag is set high, indicating "NSSA: supported"

A not-so-stubby area (NSSA) is a type of stub area that can import autonomous system external routes and send them to other areas, but still cannot receive AS-external routes from other areas. [19]

NSSA is an extension of the stub area feature that allows the injection of external routes in a limited fashion into the stub area. A case study simulates an NSSA getting around the stub-area problem of not being able to import external addresses. It visualizes the following activities: the ASBR imports external addresses with a type 7 LSA, the ABR converts a type 7 LSA to type 5 and floods it to other areas, the ABR acts as an ASBR for other areas. The ASBRs do not take type 5 LSAs and then convert to type 7 LSAs for the area.

Totally not-so-stubby area

OSPF-Totally NSSA figur.drawio.png

An addition to the standard functionality of an NSSA, the totally stubby NSSA is an NSSA that takes on the attributes of a TSA, meaning that type 3 and 4 summary routes are not flooded into this type of area. It is also possible to declare an area both totally stubby and not-so-stubby, which means that the area will receive only the default route from area 0.0.0.0, but can also contain an autonomous system boundary router (ASBR) that accepts external routing information and injects it into the local area, and from the local area into area 0.0.0.0.

Redistribution into an NSSA area creates a special type of LSA known as type 7, which can exist only in an NSSA area. An NSSA ASBR generates this LSA, and an NSSA ABR router translates it into a type 5 LSA, which gets propagated into the OSPF domain.

A newly acquired subsidiary is one example of where it might be suitable for an area to be simultaneously not-so-stubby and totally stubby if the practical place to put an ASBR is on the edge of a totally stubby area. In such a case, the ASBR does send externals into the totally stubby area, and they are available to OSPF speakers within that area. In Cisco's implementation, the external routes can be summarized before injecting them into the totally stubby area. In general, the ASBR should not advertise default into the TSA-NSSA, although this can work with extremely careful design and operation, for the limited special cases in which such an advertisement makes sense.

By declaring the totally stubby area as NSSA, no external routes from the backbone, except the default route, enter the area being discussed. The externals do reach area 0.0.0.0 via the TSA-NSSA, but no routes other than the default route enter the TSA-NSSA. Routers in the TSA-NSSA send all traffic to the ABR, except to routes advertised by the ASBR.

Router types

OSPF defines the following overlapping categories of routers:

Internal router (IR)
An internal router has all its interfaces belonging to the same area.
Area border router (ABR)
An area border router is a router that connects one or more areas to the main backbone network. It is considered a member of all areas it is connected to. An ABR keeps multiple instances of the link-state database in memory, one for each area to which that router is connected.
Backbone router (BR)
A backbone router has an interface to the backbone area. Backbone routers may also be area routers, but do not have to be.
Autonomous system boundary router (ASBR)
An autonomous system boundary router is a router that is connected by using more than one routing protocol and that exchanges routing information with routers autonomous systems. ASBRs typically also run an exterior routing protocol (e.g., BGP), or use static routes, or both. An ASBR is used to distribute routes received from other, external ASs throughout its own autonomous system. An ASBR creates External LSAs for external addresses and floods them to all areas via ABR. Routers in other areas use ABRs as next hops to access external addresses. Then ABRs forward packets to the ASBR that announces the external addresses.

The router type is an attribute of an OSPF process. A given physical router may have one or more OSPF processes. For example, a router that is connected to more than one area, and which receives routes from a BGP process connected to another AS, is both an area border router and an autonomous system boundary router.

Each router has an identifier, customarily written in the dotted-decimal format (e.g., 1.2.3.4) of an IP address. This identifier must be established in every OSPF instance. If not explicitly configured, the highest logical IP address will be duplicated as the router identifier. However, since the router identifier is not an IP address, it does not have to be a part of any routable subnet in the network, and often isn't to avoid confusion.

Non-point-to-point network

OSPF-type 2 Network-LSA figur.drawio OSPF-type 2 Network-LSA figur.drawio.png
OSPF-type 2 Network-LSA figur.drawio

On networks (same subnet) with networks type of:

A system of designated router (DR) and backup designated router (BDR), is used to reducing network traffic by providing a source for routing updates. This is done using multicast addresses:

The DR and BDR maintains a complete topology table of the network and sends the updates to the other routers via multicast. All routers in a multi-access network segment will form a leader/follower relationship with the DR and BDR. They will form adjacencies with the DR and BDR only. Every time a router sends an update, it sends it to the DR and BDR on the multicast address 224.0.0.6. The DR will then send the update out to all other routers in the area, to the multicast address 224.0.0.5. This way all the routers do not have to constantly update each other, and can rather get all their updates from a single source. The use of multicasting further reduces the network load. DRs and BDRs are always setup/elected on OSPF broadcast networks. DR's can also be elected on NBMA (Non-Broadcast Multi-Access) networks such as Frame Relay or ATM. DRs or BDRs are not elected on point-to-point links (such as a point-to-point WAN connection) because the two routers on either side of the link must become fully adjacent and the bandwidth between them cannot be further optimized. DR and non-DR routers evolve from 2-way to full adjacency relationships by exchanging DD, Request, and Update.

Designated router

A designated router (DR) is the router interface elected among all routers on a particular multiaccess network segment, generally assumed to be broadcast multiaccess. Special techniques, often vendor-dependent, may be needed to support the DR function on non-broadcast multiaccess (NBMA) media. It is usually wise to configure the individual virtual circuits of an NBMA subnet as individual point-to-point lines; the techniques used are implementation-dependent.

Backup designated router

A backup designated router (BDR) is a router that becomes the designated router if the current designated router has a problem or fails. The BDR is the OSPF router with the second-highest priority at the time of the last election.

A given router can have some interfaces that are designated (DR) and others that are backup designated (BDR), and others that are non-designated. If no router is a DR or a BDR on a given subnet, the BDR is first elected, and then a second election is held for the DR. [1] :75

DR Other

A router that has not been selected to be designated router (DR) or backup designated router (BDR). The router forms an adjacency to both the designated router (DR) and the backup designated router (BDR).

For other non (B)DR, the adjacency stops at 2-ways State.

Designated router election

The DR is elected based on the following default criteria:

Routing update flow

When DR has Routing update

  1. DR sends LSU to 224.0.0.5
  2. BDR sends LSUAck to 224.0.0.5
  3. DR Other sends LSUAck to 224.0.0.6

When BDR has Routing update

  1. BDR sends LSU to 224.0.0.5
  2. BDR sends LSUAck to 224.0.0.5
  3. DR Other sends LSUAck to 224.0.0.6

When DR Other has Routing update

  1. DR Other sends LSU to 224.0.0.6
  2. BDR sends LSA to 224.0.0.5
  3. BDR sends LSUAck to 224.0.0.5
  4. Non-source routers, DR Other sends LSUAck to 224.0.0.6

Protocol messages

OSPF v2 header format, field lengths in bytes
11244228
Version 2TypePacket lengthRouter IDArea IDChecksumAuTypeAuthentication
OSPF v3 header format, field lengths in bytes
11244211
Version 3TypePacket lengthRouter IDArea IDChecksumInstance IDReserved

Unlike other routing protocols, OSPF does not carry data via a transport protocol, such as the User Datagram Protocol (UDP) or the Transmission Control Protocol (TCP). Instead, OSPF forms IP datagrams directly, packaging them using protocol number 89 for the IP Protocol field. OSPF defines five different message types, for various types of communication. Multiple packets can be sent per frame.

OSPF uses 5 packet types:

Hello Packet

OSPF v2 hello packet, field lengths in bytes
2442114444
Header
Network MaskHello IntervalOptionsRouter PriorityRouter Dead IntervalDesignated Router IDBackup Designated Router IDNeighbor ID
OSPF v3 hello packet, field lengths in bytes
1641322444
Header
Interface IDRouter PriorityOptionsHello IntervalRouter Dead IntervalDesignated Router IDBackup Designated Router IDNeighbor ID

OSPF's Hello messages are used as a form of greeting, to allow a router to discover other adjacent routers on its local links and networks. The messages establish relationships between neighboring devices (called adjacencies) and communicate key parameters about how OSPF is to be used in the autonomous system or area. During normal operation, routers send hello messages to their neighbors at regular intervals (the hello interval); if a router stops receiving hello messages from a neighbor, after a set period (the dead interval) the router will assume the neighbor has gone down.

Database description (DBD)

OSPF v2 and v3 database description, field lengths in bytes
16 or 2421114Variable
Header
Interface MTUHello IntervalOptionsFlagsDD sequence numberLSA Headers

Database description messages contain descriptions of the topology of the autonomous system or area. They convey the contents of the link-state database (LSDB) for the area from one router to another. Communicating a large LSDB may require several messages to be sent by having the sending device designated as a leader device and sending messages in sequence, with the follower (recipient of the LSDB information) responding with acknowledgments.

OSPF v2 link state request, field lengths in bytes
24444
Header
LS TypeLink State IDAdvertising Router
OSPF v3 link state request, field lengths in bytes
162244
Header
ReservedLS TypeLink State IDAdvertising Router
Link state request (LSR)
Link state request messages are used by one router to request updated information about a portion of the LSDB from another router. The message specifies the link(s) for which the requesting device wants more current information.
OSPF v2 and v3 link state update packet, field lengths in bytes
24 or 164Variable
Header
# LSAsList of LSAs
Link state update (LSU)
Link-state update messages contain updated information about the state of certain links on the LSDB. They are sent in response to a link state request message, and also broadcast or multicast by routers on a regular basis. Their contents are used to update the information in the LSDBs of routers that receive them.
OSPF v2 and v3 link state acknowledgment, field lengths in bytes
24 or 16Variable
Header
List of LSAs
Link state acknowledgment (LSAck)
Link-state acknowledgment messages provide reliability to the link-state exchange process, by explicitly acknowledging receipt of a Link State Update message.
OSPF link state advertisements
LS typeLS nameGenerated byDescription
1Router-LSAsEach internal router within an area
OSPF-type 1 figur.drawio.png

The link-state ID of the type 1 LSA is the originating router ID. Router-LSAs, describe the following types of interfaces:

  • Point-to-point connection to another router
  • Connection to a transit network
  • Connection to a stub network (Reserved in v3)
  • Virtual link
2Network-LSAsThe DR
OSPF-type 2 Network-LSA figur.drawio.png
Originated for broadcasts and NBMA networks by the designated router. This LSA contains the list of routers connected to the network. The link-state ID of the type 2 LSA is the IP interface address of the DR.
3Summary-LSAsThe ABR
OSPF-type3 Summary-LSAs figur.drawio.png
Type 3 summary-LSAs describe routes to networks.

To inform other areas about inter-area routers. These routes can also be summarised.

4ASBR-summaryThe ABRType 4 describe routes to AS boundary routers beyond its area.

The area border router (ABR) generates this LSA to inform other routers in the OSPF domain, that the matching router is an autonomous system boundary router (ASBR), so that the external LSAs (Type 5 / Type 7) it sent may be properly resolved outside its own area.

5AS-external-LSAsThe ASBR
OSPF-Type-4 & Type-5 figur.drawio.png
Type 5 These describe routes advertised by the ASBR.

LSAs contain information imported into OSPF from other routing processes. Together with Type 4 they describe the way to an external route.

7NSSA external link-state advertisementsThe ASBR, within a not-so-stubby areaType 7-LSAs are identical to type-5 LSAs. Type-7 LSAs are only flooded within the NSSA. At the area border router, selected type-7 LSAs are translated into type 5-LSAs and flooded into the backbone.
8Link-LSA (v3)Each internal router within a linkProvide it local router's link-local address to all other routers on the local network.
9Intra-Area-Prefix-LSAs (v3)Each internal router within an areaReplaces some of the functionality of Router-LSAs; stub network segment, or an attached transit network segment.

OSPF v2 area types and accepted LSAs

Not all area types use all LSA. Below is a matrix of accepted LSAs.

Overview of OSPF area types and accepted LSAs: [21] [22]
Within a single areaInter area
Area typeLSA 1 - routerLSA 2 - networkLSA 7 - NSSA externalLSA 3 - network summaryLSA 4 - ASBR SummaryLSA 5 - AS external
BackboneYesYesNo, converted into a Type 5 by the ABRYesYesYes
Non-backboneYesYesNo, converted into a Type 5 by the ABRYesYesYes
StubYesYesNo, Default routeYesNo, Default routeNo, Default route
Totally stubbyYesYesNo, Default routeNo, Default routeNo, Default routeNo, Default route
Not-so-stubbyYesYesYesYesNo, Default routeNo, Default route
Totally not-so-stubbyYesYesYesNo, Default routeNo, Default routeNo, Default route

Routing metrics

OSPF uses path cost as its basic routing metric, which was defined by the standard not to equate to any standard value such as speed, so the network designer could pick a metric important to the design. In practice, it is determined by comparing the speed of the interface to a reference-bandwidth for the OSPF process. The cost is determined by dividing the reference bandwidth by the interface speed (although the cost for any interface can be manually overridden). If a reference bandwidth is set to '10000', then a 10 Gbit/s link will have a cost of 1. Any speeds less than 1 are rounded up to 1. [23] Here is an example table that shows the routing metric or 'cost calculation' on an interface.

Calculation for reference speed
Interface speedLink costUses
Default (100 Mbit/s)200 Gbit/s
800 Gbit/s11 QSFP-DD112
200 Gbit/s11 SFP-DD
40 Gbit/s15 QSFP+
25 Gbit/s18 SFP28
10 Gbit/s120 10 GigE, common in data centers
5 Gbit/s140 NBase-T, Wi-Fi routers
1 Gbit/s1200common gigabit port
100 Mbit/s12000low-end port
10 Mbit/s10200001990's speed.

OSPF is a layer 3 protocol. If a layer 2 switch is between the two devices running OSPF, one side may negotiate a speed different from the other side. This can create an asymmetric routing on the link (Router 1 to Router 2 could cost '1' and the return path could cost '10'), which may lead to unintended consequences.

Metrics, however, are only directly comparable when of the same type. Four types of metrics are recognized. In decreasing preference (for example, an intra-area route is always preferred to an external route regardless of metric), these types are:

  1. Intra-area
  2. Inter-area
  3. External Type 1, which includes both the external path cost and the sum of internal path costs to the ASBR that advertises the route, [25]
  4. External Type 2, the value of which is solely that of the external path cost,

OSPF v3

OSPF version 3 introduces modifications to the IPv4 implementation of the protocol. [2] Despite the expansion of addresses to 128 bits in IPv6, area and router identifications are still 32-bit numbers.

High-level changes

Changes introduced in OSPF v3, then backported by vendors to v2

Packet format changes

LSA format changes

OSPF over MPLS VPN

OSPF with BGP-MPLS VPN backbone.svg
BGP extended communities transitive for OSPF [27]
TypeType fieldsub valuename
Two-octet AS 0x000x05OSPF domain identifier
Four-octet AS 0x020x05OSPF domain identifier
IPv4 address0x010x05OSPF domain identifier
IPv4 address0x010x07OSPF route ID
Opaque0x030x06OSPF route type
BGP extended communities
Attribute for OSPF route type
4 byte1 byte1 byte
Area numberRoute typeOptions

A customer can use OSPF over a MPLS VPN, where the service provider uses BGP or RIP as their interior gateway protocol. [8] When using OSPF over MPLS VPN, the VPN backbone becomes part of the OSPF backbone area 0. In all areas, isolated copies of the IGP are run.

Advantages:

To achieve this, a modified OSPF-BGP redistribution is used. All OSPF routes retain the source LSA type and metric. [28] [29] To prevent loops, an optional DN bit [30] is set by the service provider in LSAs from the provider equipment to indicate that a route has already been sent to the customer's equipment.

OSPF extensions

Traffic engineering

OSPF-TE is an extension to OSPF extending the expressivity to allow for traffic engineering and use on non-IP networks. [31] Using OSPF-TE, more information about the topology can be exchanged using opaque LSA carrying type–length–value elements. These extensions allow OSPF-TE to run completely out of band of the data plane network. This means that it can also be used on non-IP networks, such as optical networks.

OSPF-TE is used in GMPLS networks as a means to describe the topology over which GMPLS paths can be established. GMPLS uses its own path setup and forwarding protocols, once it has the full network map.

In the Resource Reservation Protocol (RSVP), OSPF-TE is used for recording and flooding RSVP signaled bandwidth reservations for label-switched paths within the link-state database.

Optical routing

RFC   3717 documents work in optical routing for IP based on extensions to OSPF and IS-IS. [32]

Multicast Open Shortest Path First

The Multicast Open Shortest Path First (MOSPF) protocol is an extension to OSPF to support multicast routing. MOSPF allows routers to share information about group memberships.

Notable implementations

Applications

OSPF is a widely deployed routing protocol that can converge a network in a few seconds and guarantee loop-free paths. It has many features that allow the imposition of policies about the propagation of routes that it may be appropriate to keep local, for load sharing, and for selective route importing. IS-IS, in contrast, can be tuned for lower overhead in a stable network, the sort more common in ISP than enterprise networks. There are some historical accidents that made IS-IS the preferred IGP for ISPs, but ISPs today may well choose to use the features of the now-efficient implementations of OSPF, [33] after first considering the pros and cons of IS-IS in service provider environments. [34]

OSPF can provide better load-sharing on external links than other IGPs.[ citation needed ] When the default route to an ISP is injected into OSPF from multiple ASBRs as a Type I external route and the same external cost specified, other routers will go to the ASBR with the least path cost from its location. This can be tuned further by adjusting the external cost. If the default route from different ISPs is injected with different external costs, as a Type II external route, the lower-cost default becomes the primary exit and the higher-cost becomes the backup only.

See also

Related Research Articles

An Internet Protocol address is a numerical label such as 192.0.2.1 that is assigned to a device connected to a computer network that uses the Internet Protocol for communication. IP addresses serve two main functions: network interface identification, and location addressing.

<span class="mw-page-title-main">IPv6</span> Version 6 of the Internet Protocol

Internet Protocol version 6 (IPv6) is the most recent version of the Internet Protocol (IP), the communications protocol that provides an identification and location system for computers on networks and routes traffic across the Internet. IPv6 was developed by the Internet Engineering Task Force (IETF) to deal with the long-anticipated problem of IPv4 address exhaustion, and was intended to replace IPv4. In December 1998, IPv6 became a Draft Standard for the IETF, which subsequently ratified it as an Internet Standard on 14 July 2017.

<span class="mw-page-title-main">Border Gateway Protocol</span> Protocol for communicating routing information on the Internet

Border Gateway Protocol (BGP) is a standardized exterior gateway protocol designed to exchange routing and reachability information among autonomous systems (AS) on the Internet. BGP is classified as a path-vector routing protocol, and it makes routing decisions based on paths, network policies, or rule-sets configured by a network administrator.

A multicast address is a logical identifier for a group of hosts in a computer network that are available to process datagrams or frames intended to be multicast for a designated network service. Multicast addressing can be used in the link layer, such as Ethernet multicast, and at the internet layer for Internet Protocol Version 4 (IPv4) or Version 6 (IPv6) multicast.

The Routing Information Protocol (RIP) is one of the oldest distance-vector routing protocols which employs the hop count as a routing metric. RIP prevents routing loops by implementing a limit on the number of hops allowed in a path from source to destination. The largest number of hops allowed for RIP is 15, which limits the size of networks that RIP can support.

<span class="mw-page-title-main">Network address translation</span> Technique for making connections between IP address spaces

Network address translation (NAT) is a method of mapping an IP address space into another by modifying network address information in the IP header of packets while they are in transit across a traffic routing device. The technique was initially used to bypass the need to assign a new address to every host when a network was moved, or when the upstream Internet service provider was replaced but could not route the network's address space. It has become a popular and essential tool in conserving global address space in the face of IPv4 address exhaustion. One Internet-routable IP address of a NAT gateway can be used for an entire private network.

In the seven-layer OSI model of computer networking, the network layer is layer 3. The network layer is responsible for packet forwarding including routing through intermediate routers.

<span class="mw-page-title-main">Anycast</span> Network addressing and routing methodology

Anycast is a network addressing and routing methodology in which a single IP address is shared by devices in multiple locations. Routers direct packets addressed to this destination to the location nearest the sender, using their normal decision-making algorithms, typically the lowest number of BGP network hops. Anycast routing is widely used by content delivery networks such as web and name servers, to bring their content closer to end users.

A stub network, or pocket network, is a somewhat casual term describing a computer network, or part of an internetwork, with no knowledge of other networks, that will typically send much or all of its non-local traffic out via a single path, with the network aware only of a default route to non-local destinations. As a practical analogy, think of an island which is connected to the rest of the world through a bridge and no other path is available either through air or sea. Continuing this analogy, the island might have more than one physical bridge to the mainland, but the set of bridges still represents only one logical path.

The Virtual Router Redundancy Protocol (VRRP) is a computer networking protocol that provides for automatic assignment of available Internet Protocol (IP) routers to participating hosts. This increases the availability and reliability of routing paths via automatic default gateway selections on an IP subnetwork.

Cisco Discovery Protocol (CDP) is a proprietary data link layer protocol developed by Cisco Systems in 1994 by Keith McCloghrie and Dino Farinacci. It is used to share information about other directly connected Cisco equipment, such as the operating system version and IP address. CDP can also be used for On-Demand Routing, which is a method of including routing information in CDP announcements so that dynamic routing protocols do not need to be used in simple networks.

NetFlow is a feature that was introduced on Cisco routers around 1996 that provides the ability to collect IP network traffic as it enters or exits an interface. By analyzing the data provided by NetFlow, a network administrator can determine things such as the source and destination traffic, class of service, and the causes of congestion. A typical flow monitoring setup consists of three main components:

<span class="mw-page-title-main">XORP</span> Internet Protocol routing software

XORP is an open-source Internet Protocol routing software suite originally designed at the International Computer Science Institute in Berkeley, California. The name is derived from eXtensible Open Router Platform. It supports OSPF, BGP, RIP, PIM, IGMP, OLSR.

The Neighbor Discovery Protocol (NDP), or simply Neighbor Discovery (ND), is a protocol of the Internet protocol suite used with Internet Protocol Version 6 (IPv6). It operates at the internet layer of the Internet model, and is responsible for gathering various information required for network communication, including the configuration of local connections and the domain name servers and gateways.

IP multicast is a method of sending Internet Protocol (IP) datagrams to a group of interested receivers in a single transmission. It is the IP-specific form of multicast and is used for streaming media and other network applications. It uses specially reserved multicast address blocks in IPv4 and IPv6.

The link-state advertisement (LSA) is a basic communication means of the OSPF routing protocol for the Internet Protocol (IP). It communicates the router's local routing topology to all other local routers in the same OSPF area. OSPF is designed for scalability, so some LSAs are not flooded out on all interfaces, but only on those that belong to the appropriate area. In this way detailed information can be kept localized, while summary information is flooded to the rest of the network. The original IPv4-only OSPFv2 and the newer IPv6-compatible OSPFv3 have broadly similar LSA types.

A network socket is a software structure within a network node of a computer network that serves as an endpoint for sending and receiving data across the network. The structure and properties of a socket are defined by an application programming interface (API) for the networking architecture. Sockets are created only during the lifetime of a process of an application running in the node.

In computer networking, a link-local address is a network address that is valid only for communications on a local link, i.e. within a subnetwork that a host is connected to. Link-local addresses are typically assigned automatically through a process known as link-local address autoconfiguration, also known as auto-IP, automatic private IP addressing, and stateless address autoconfiguration. While most link-local addresses are unicast, this is not necessarily the case; e.g. IPv6 addresses beginning with ff02:, and IPv4 addresses beginning with 224.0.0. are multicast addresses that are link-local.

A routing protocol specifies how routers communicate with each other to distribute information that enables them to select paths between nodes on a computer network. Routers perform the traffic directing functions on the Internet; data packets are forwarded through the networks of the internet from router to router until they reach their destination computer. Routing algorithms determine the specific choice of route. Each router has a prior knowledge only of networks attached to it directly. A routing protocol shares this information first among immediate neighbors, and then throughout the network. This way, routers gain knowledge of the topology of the network. The ability of routing protocols to dynamically adjust to changing conditions such as disabled connections and components and route data around obstructions is what gives the Internet its fault tolerance and high availability.

<span class="mw-page-title-main">Multicast routing</span> Computer networking protocol for forwarding transmissions from one sender to multiple receivers

Multicast routing is one of the routing protocols in IP networking.

References

  1. 1 2 3 4 5 J. Moy (April 1998). OSPF Version 2. Network Working Group. doi: 10.17487/RFC2328 . STD 54. RFC 2328.Internet Standard 54. Obsoletes RFC  2178. Updated by RFC  5709, 6549, 6845, 6860, 7474 and 8042.
  2. 1 2 3 4 R. Coltun; D. Ferguson; J. Moy (July 2008). A. Lindem (ed.). OSPF for IPv6. Network Working Group. doi: 10.17487/RFC5340 . RFC 5340.Proposed Standard. Obsoletes RFC  2740. Updated by RFC  6845, 6860, 8362, 7503 and 9454
  3. OSPF Convergence, August 6, 2009, archived from the original on August 5, 2016, retrieved June 13, 2016
  4. J. Moy (March 1994). Multicast Extensions to OSPF. Network Working Group. doi: 10.17487/RFC1584 . RFC 1584.Historic.
  5. IP Routing: OSPF Configuration Guide, Cisco Systems, archived from the original on August 10, 2016, retrieved June 13, 2016, Cisco routers do not support LSA Type 6 Multicast OSPF (MOSPF), and they generate syslog messages if they receive such packets.
  6. "[Junos] GRE Configuration Example - Juniper Networks". kb.juniper.net. Archived from the original on November 28, 2021. Retrieved November 28, 2021.
  7. "Generic Routing Encapsulation (GRE) | Interfaces User Guide for Switches | Juniper Networks TechLibrary". www.juniper.net. Archived from the original on November 28, 2021. Retrieved November 28, 2021.
  8. 1 2 E. Rosen; P. Psenak; P. Pillay-Esnault (June 2006). OSPF as the Provider/Customer Edge Protocol for BGP/MPLS IP Virtual Private Networks (VPNs). Network Working Group. doi: 10.17487/RFC4577 . RFC 4577.Proposed Standard. Updates RFC  4364.
  9. "OSPF Neighbor States". Cisco. Archived from the original on October 26, 2018. Retrieved October 28, 2018.
  10. "Show 134 – OSPF Design Part 1 – Debunking the Multiple Area Myth". Packet Pushers. Archived from the original on June 2, 2021. Retrieved February 2, 2021. podcast debunking 50-router advice on old Cisco article
  11. Mikrotik RB4011 has 1 GB RAM for example Archived August 16, 2021, at the Wayback Machine , mikrotik.com, Retrieved Feb 1, 2021.
  12. "Stub Area Design Golden Rules". Groupstudy.com. Archived from the original on August 31, 2000. Retrieved November 30, 2011. 64 MB of RAM was a big deal in 2020 for OSPF.
  13. Doyle, Jeff (September 10, 2007). "My Favorite Interview Question". Network World. Archived from the original on December 28, 2021. Retrieved December 28, 2021.
  14. ( ASGuidelines 1996 , p. 25)
  15. J. Hawkinson; T. Bates (March 1996). Guidelines for creation, selection, and registration of an Autonomous System (AS). Network Working Group. doi: 10.17487/RFC1930 . BCP 6. RFC 1930.Best Current Practice 6. Updated by RFC  6996 and 7300.
  16. "Stub Area Design Golden Rules". Groupstudy.com. Archived from the original on August 31, 2000. Retrieved November 30, 2011.. This is not necessarily true. If there are multiple ABRs, as might be required for high availability, routers interior to the TSA will send non-intra-area traffic to the ABR with the lowest intra-area metric (the closest ABR) but that requires special configuration.
  17. P. Murphy (January 2001). The OSPF Not-So-Stubby Area (NSSA) Option. Network Working Group. doi: 10.17487/RFC3101 . RFC 3101.Proposed Standard. Obsoletes RFC  1587.
  18. "Cisco IOS IP Routing: OSPF Command Reference" (PDF). Cisco Systems. April 2011. Archived from the original (PDF) on April 25, 2012.
  19. "juniper configuring-ospf-areas". Juniper Networks. January 18, 2021. Archived from the original on October 23, 2021. Retrieved October 23, 2021.
  20. "OSPF Area's Explained". Packet Coders. January 23, 2019. Archived from the original on October 23, 2021. Retrieved October 23, 2021.
  21. Adjusting OSPF Costs Archived April 14, 2021, at the Wayback Machine , OReilly.com
  22. "OSPF Stub Router Advertisement". Ietf Datatracker. Internet Engineering Task Force. June 2001. Archived from the original on October 23, 2021. Retrieved October 23, 2021.
  23. Whether an external route is based on a Type-5 LSA or a Type-7 LSA (NSSA) does not affect its preference. See RFC 3101, section 2.5.
  24. "secondary (Protocols OSPF) - TechLibrary - Juniper Networks". www.juniper.net. Archived from the original on November 7, 2021. Retrieved November 7, 2021.
  25. "Border Gateway Protocol (BGP) Extended Communities". www.iana.org. Archived from the original on November 28, 2021. Retrieved November 28, 2021.
  26. "MPLS VPN OSPF PE and CE Support". Cisco. Archived from the original on November 28, 2021. Retrieved November 28, 2021.
  27. Cisco. "Using OSPF in an MPLS VPN Environment" (PDF). Archived (PDF) from the original on October 10, 2022. Retrieved November 28, 2021.
  28. E. Rosen; P. Psenak; P. Pillay-Esnault (June 2006). Using a Link State Advertisement (LSA) Options Bit to Prevent Looping in BGP/MPLS IP Virtual Private Networks (VPNs). Network Working Group. doi: 10.17487/RFC4576 . RFC 4576.Proposed Standard.
  29. Katz, D; D. Yeung (September 2003). Traffic Engineering (TE) Extensions to OSPF Version 2. The Internet Society. doi: 10.17487/RFC3630 . OSPF-TEextensions. Retrieved September 28, 2007. Archived February 14, 2012, at the Wayback Machine
  30. B. Rajagopalan; J. Luciani; D. Awduche (March 2004). IP over Optical Networks: A Framework. Internet Engineering Task Force. doi: 10.17487/RFC3717 . RFC 3717.
  31. Berkowitz, Howard (1999). OSPF Goodies for ISPs. North American Network Operators Group NANOG 17. Montreal. Archived from the original on June 12, 2016.
  32. Katz, Dave (2000). OSPF and IS-IS: A Comparative Anatomy. North American Network Operators Group NANOG 19. Albuquerque. Archived from the original on June 20, 2018.

Further reading