Skip to main content

Link-state routing protocol features

Link-state routing protocol features 
6.2.6
The other basic algorithm that is used for routing is the link-state algorithm. This page will explain how the link-state algorithm works.
The link-state algorithm is also known as Dijkstra's algorithm or as the shortest path first (SPF) algorithm. The link-state routing algorithm maintains a complex database of topology information. The distance vector algorithm has nonspecific information about distant networks and no knowledge of distant routers. The link-state routing algorithm maintains full knowledge of distant routers and how they interconnect.
Link-state routing uses the following features:
  • Link-state advertisement (LSA) - a small packet of routing information that is sent between routers
  • Topological database - a collection of information gathered from LSAs
  • SPF algorithm - a calculation performed on the database that results in the SPF tree
  • Routing table - a list of the known paths and interfaces

Network discovery processes for link state routing
When routers exchange LSAs, they begin with directly connected networks for which they have information. Each router constructs a topological database that consists of all the exchanged LSAs.
The SPF algorithm computes network reachability. The router constructs this logical topology as a tree, with itself as the root. This topology consists of all possible paths to each network in the link-state protocol internetwork. The router then uses SPF to sort these paths. The router lists the best paths and the interfaces to these destination networks in the routing table. It also maintains other databases of topology elements and status details.
The first router that learns of a link-state topology change forwards the information so that all other routers can use it for updates. Common routing information is sent to all routers in the internetwork. To achieve convergence, each router learns about its neighbor routers. This includes the name of each neighbor router, the interface status, and the cost of the link to the neighbor. The router constructs an LSA packet that lists this information along with new neighbors, changes in link costs, and links that are no longer valid. The LSA packet is then sent out so that all other routers receive it.
When a router receives an LSA, it updates the routing table with the most recent information. The accumulated data is used to create a map of the internetwork and the SPF algorithm is used to calculate the shortest path to other networks. Each time an LSA packet causes a change to the link-state database, SPF recalculates the best paths and updates the routing table.
There are three main concerns related to link-state protocols:
  • Processor overhead
  • Memory requirements
  • Bandwidth consumption
Routers that use link-state protocols require more memory and process more data than routers that use distance vector routing protocols. Link-state routers need enough memory to hold all of the information from the various databases, the topology tree, and the routing table. Initial link-state packet flooding consumes bandwidth. In the initial discovery process, all routers that use link-state routing protocols send LSA packets to all other routers. This action floods the internetwork and temporarily reduces the bandwidth available for routed traffic that carries user data. After this initial flooding, link-state routing protocols generally require minimal bandwidth to send infrequent or event-triggered LSA packets that reflect topology changes.
This page concludes this lesson. The next lesson will provide an overview of routing protocols. The first page explains how a router performs path determination.

Comments

Post a Comment

Popular posts from this blog

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

PC Basic...

• Backplane – A backplane is an electronic circuit board containing circuitry and sockets into which additional electronic devices on other circuit boards or cards can be plugged; in a computer, generally synonymous with or part of the motherboard. • Network interface card (NIC) – An expansion board inserted into a computer so that the computer can be connected to a network. • Video card – A board that plugs into a PC to give it display capabilities. • Audio card – An expansion board that enables a computer to manipulate and output sounds. • Parallel port – An interface capable of transferring more than one bit simultaneously that is used to connect external devices such as printers. • Serial port – An interface that can be used for serial communication in which only one bit is transmitted at a time. • Mouse port – A port used to connect a mouse to a PC. • USB port – A Universal Serial Bus connector. A USB port connects devices such as a mouse or printer to the computer ...
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