Model Features: OSPF
The section lists the main features available in the OSPF model suite:
Table 170: OSPF Model Features
| Feature | Description | Supported In: v2 | Supported In: v3 |
|---|---|---|---|
| Link-State Routing | OSPF is a link-state routing protocol. Each router sends link-state advertisements (LSAs) to the other routers in its domain. Upon receiving link-state information, routers use the shortest path first (SPF) algorithm to calculate the shortest paths to all destinations. | Yes | Yes |
| Equal-cost/Multi-path Routing | When there are multiple paths of equal cost to a destination, OSPF includes all of these paths in the IP routing table. This allows load balancing across equal-cost paths to a given destination. For application data to make use of all the routes for load balancing, you must set the IP > IP Routing Parameters > Load Balancing Options attribute value to “Packet Based”. | Yes | Yes |
| Classless Inter-Domain Routing (CIDR) | OSPF supports CIDR addressing, which is also known as Variable Length Subnet Mask (VLSM). In CIDR, an IP network can be divided into subnets of different sizes, providing extra network configuration flexibility. | Yes | Yes |
| Multiple Processes | Multiple OSPF processes can be configured on a router. The interfaces of a router can be configured to run one of the processes configured on that router. Each OSPF process builds its own link state database. The Reports > OSPF Link State Database attribute lets you export at different times during the simulation. | Yes | Yes |
| Multiple Areas | OSPF can operate within a hierarchy. the models have the following area configuration options: Areas: An OSPF network (such as an autonomous system, AS) can be divided into several areas, where each area is typically a group of contiguous networks and attached hosts. Routing information from one area is disseminated to other areas by area border routers (ABRs), which are routers that belong to multiple areas. Backbone: The OSPF backbone is responsible for distributing routing information among areas. All areas must be connected to the backbone area, by an ABR or by a virtual link. Since the backbone is also an OSPF area, routers in the backbone area maintain routing information using the same procedures and algorithms that any area router uses to maintain routing information. By default, all routers are configured to belong to the backbone area. |
Yes | Yes |
| Traffic Engineering (TE) | The OSPF model suite supports TE extensions, which are used to set up MPLS LSPs (label switched paths). The following TE features are supported: - Distribution of TE attributes (cost, color, and bandwidth) through LSAs (link state advertisements) - Computation of CSPF (Constrained Shortest Path First) routes for LSP path calculation using cost or delay as the optimization metric |
Yes | No |
| Topology Database | Each router maintains a topological database with the collection of LSAs received from all other routers in the same area. ABRs maintain separate topological databases for each area, where a topological database is essentially an overall picture of networks in relationship to routers. Since routers within the same area share the same information, they also have identical topological databases. | Yes | Yes |
| Virtual Links | OSPF areas can be defined in such a way that some areas are not physically connected to the backbone area by an ABR. In this case, backbone connectivity must be restored through virtual links. A virtual link functions like a direct link configured between a backbone router and a router in the unconnected area. Virtual links are also used to connect discontiguous parts of the backbone. |
Yes | No |
| Route Aggregation at Area Boundaries | This is used to condense routing information by reducing a group of routes to a single advertisement, reducing both the load on the router and the perceived complexity of the network. | Yes | Yes |
| Designated Router Election | The model includes configurable parameters for determining which router acts as the designated router. | Yes | Yes |
| Metric Configuration | An interface’s cost is determined by setting it explicitly or from a bandwidth specification. | Yes | Yes |
| Hello Protocol | When a router’s interface becomes active, it uses the Hello protocol to learn about its neighbors (i.e., routers that have interfaces to a common network). A router also exchanges hello packets that act as keep-alives with its neighbors—these inform neighboring routers that it is still functional. In the OSPFv3 MANET implementation, partial hellos are used to reduce overhead. The sender sends partial hellos most of the time with incremental information, and every nth hello (n is configurable) is a full hello with the information of all neighbors. The receiver implements a sliding window mechanism to keep its repositories up to date. |
Yes | Yes |
| Route Redistribution | Routes can be learned from other OSPF processes, from other routing protocols (RIP, IGRP, EIGRP, and BGP), or from directly connected interfaces not running OSPF. | Yes | Yes |
| Message Priority | You can set the priority of OSPF messages exchanged in the entire network by specifying the DSCP marking of the messages using the corresponding global attribute. The default value is CS6. | Yes | Yes |
- Configurable parameters per–IP interface include the following:
- Process and area to which the interface belongs
- Type of the interface (point-to-point, broadcast, non-broadcast multiple-access, or MANET)
- Protocol timers (hello, router dead interval, retransmission)
- Priority (used for designated router (DR) election)
- Neighbor list (for NBMA networks)
- Configurable per-process parameters include the following:
- Address summarization
- External route information (OSPFv2 only)
- Virtual link configurations, including its associated timers (OSPFv2 only)
- Route redistribution (OSPFv2 only)