Skip to main content

OSPF terminology


OSPF terminology
2.2.2 There are many words and concepts for students in this TI and the figures should help to explain them. Use the interactive media activity to reinforce the terms and their abbreviations. Instructors might like to hold an acronym competition to see who can explain the words and concepts in the following table:
Link
A link is a physical and electrical connection between two network devices.
Link-state (LS)
Link-state is the status of a link between two routers. This status includes information about a router interface and its relationship to neighboring routers.
Cost
Cost is the value assigned to a link. Link-state protocols assign a cost to a link, which is based on the speed of the network connection.
Area
An area is a collection of networks and routers that has the same area identification. Each router within an area has the same link-state information. A router within an area is called an internal router.
Designated Router (DR)
A DR is one router on an OSPF multi-access network that represents all the routers in that network. Each OSPF network has a DR and BDR. These routers have special responsibilities that are discussed later in this module.
Backup Designated Router (BDR)
A BDR is a standby router that becomes the DR, if the original DR fails.
Adjacencies database (AD)
An AD is a listing of all the neighbors to which a router has established bi-directional communication.
Link-state database (LSD) or topological database
An LSD is a list of information about all other routers in the network. It shows the network topology. All routers within an area have identical link-state databases.
Routing table
The routing table, also known as the forwarding database, is generated when an algorithm is run on the link-state database. Each routing table is unique and contains information of how and where to send packets to other routers.
SPF algorithm
An SPF algorithm is a routing algorithm that iterates on length of path to determine a shortest-path spanning tree.
Link-state advertisement (LSA)
An LSA is a broadcast packet used by link-state protocols that contain information about neighbors and path costs. LSAs are used by the receiving routers to maintain their routing tables.


Link-state routers identify neighboring routers and then communicate with the identified neighbors. OSPF has its own terminology. The new terms are shown in Figure .
OSPF gathers information from neighbor routers about the link status of each OSPF router. This information is flooded to all its neighbors. An OSPF router advertises its own link-states and passes on received link-states.
The routers process the information about link-states and build a link-state database. Every router in the OSPF area will have the same link-state database. Therefore, every router has the same information about the state of the links and the neighbors of every other router.
Each router then applies the SPF algorithm on its own copy of the database. This calculation determines the best route to a destination. The SPF algorithm adds up the cost, which is a value that is usually based on bandwidth. The lowest cost path is added to the routing table, which is also known as the forwarding database.
Each router keeps a list of adjacent neighbors, called the adjacency database. The adjacency database is a list of all the neighbor routers to which a router has established bidirectional communication. This is unique to each router.
To reduce the number of exchanges of routing information among several neighbors on the same network, OSPF routers elect a designated router (DR) and a backup designated router (BDR) that serve as focal points for routing information exchange.
The Interactive Media Activity will teach students about OSPF terminology.
The next page will compare OSPF to distance vector protocols.


Comments

Post a Comment

Popular posts from this blog

Windowing

Windowing 11.1.5 This page will explain how windows are used to transmit data. Data packets must be delivered to the recipient in the same order in which they were transmitted to have a reliable, connection-oriented data transfer. The protocol fails if any data packets are lost, damaged, duplicated, or received in a different order. An easy solution is to have a recipient acknowledge the receipt of each packet before the next packet is sent. If a sender had to wait for an ACK after each packet was sent, throughput would be low. Therefore, most connection-oriented, reliable protocols allow multiple packets to be sent before an ACK is received. The time interval after the sender transmits a data packet and before the sender processes any ACKs is used to transmit more data. The number of data packets the sender can transmit before it receives an ACK is known as the window size, or window. TCP uses expectational ACKs. This means that the ACK number refers to the next packet that is...
Post a Comment
Read more

OSI layers / Peer-to-peer communications / TCP/IP model

OSI layers 2.3.4 This page discusses the seven layers of the OSI model. The OSI reference model is a framework that is used to understand how information travels throughout a network. The OSI reference model explains how packets travel through the various layers to another device on a network, even if the sender and destination have different types of network media. In the OSI reference model, there are seven numbered layers, each of which illustrates a particular network function. - Dividing the network into seven layers provides the following advantages: • It breaks network communication into smaller, more manageable parts. • It standardizes network components to allow multiple vendor development and support. • It allows different types of network hardware and software to communicate with each other. • It prevents changes in one layer from affecting other layers. • It divides network communication into smaller parts to make learning it easier to understand. In the foll...
Post a Comment
Read more

1.2.2 RIP V2 Features

 1.2.2 RIP V2 Features This page will discuss RIP v2, which is an improved version of RIP v1. Both versions of RIP share the following features: It is a distance vector protocol that uses a hop count metric. It uses hold down timers to prevent routing loops – default is 180 seconds. It uses split horizon to prevent routing loops. It uses 16 hops as a metric for infinite distance. RIP v2 provides prefix routing, which allows it to send out subnet mask information with the route update. Therefore, RIP v2 supports the use of classless routing in which different subnets within the same network can use different subnet masks, as in VLSM. RIP v2 provides for authentication in its updates. A set of keys can be used on an interface as an authentication check. RIP v2 allows for a choice of the type of authentication to be used in RIP v2 packets. The choice can be either clear text or Message-Digest 5 (MD5) encryption. Clear text is the default. MD5 can be used t...
Post a Comment
Read more