Skip to main content

How routing information is maintained

How routing information is maintained

2.1.3 This page will explain how link-state protocols use the following features:
  • The LSAs
  • A topological database
  • The SPF algorithm
  • The SPF tree
  • A routing table of paths and ports to determine the best path for packets 
Link-state routing protocols were designed to overcome the limitations of distance vector routing protocols. For example, distance vector protocols only exchange routing updates with immediate neighbors while link-state routing protocols exchange routing information across a much larger area.
When a failure occurs in the network, such as a neighbor becomes unreachable, link-state protocols flood LSAs with a special multicast address throughout an area. This process sends information out all ports, except the port on which the information was received. Each link-state router takes a copy of the LSA and updates its link-state, or topological database. The link-state router then forwards the LSA to all neighbor devices. LSAs cause every router within the area to recalculate routes. For this reason, the number of link-state routers within an area should be limited.
A link is the same as an interface on a router. The state of the link is a description of an interface and the relationship to the neighbor routers. For example, a description of the interface would include the IP address of the interface, the subnet mask, the type of network that it is connected to, the routers connected to that network, and so on. The collection of link-states form a link-state database which is sometimes called a topological database. The link-state database is used to calculate the best paths through the network. Link-state routers apply the Dijkstra shortest path first algorithm against the link-state database. This builds the SPF tree with the local router as the root. The best paths are then selected from the SPF tree and placed in the routing table.
The next page will discuss the link-state routing algorithm.

Comments

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...

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 ...

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...