Fixed and Flooding Routing algorithms

Difference between Distance vector routing and Link State routing

Last Updated : 19 Feb, 2025

Routing is a process in computer networks which is used to find best path to transmit data packets from one node to another. Distance Vector Routing and Link State Routing are two most used dynamic routing algorithms. They both are a part of Intradomain routing which refer to routing of devices within a same network.

Distance Vector Routing

Distance Vector Routing is an algorithm that is subject to change where a router calculates distances to every possible destination based on its immediate neighbors only, the router’s routing table is shared with routers that are directly connected, during regular intervals, this received information makes the routers update their tables while route computation uses Bellman-Ford algorithm most of the time, in spite of being relatively simple. However, Distance Vector Routing has some problems such as Count to Infinity or persistent routing loops.

Read more about Distance Vector Routing.

Link State Routing

Link State Routing, as opposed to Distance Vector Routing, is a dynamic routing algorithm such that each router maintains knowledge of the entire network, instead of sharing information only with neighbors, routers flood their link state information across the entire network to make sure all routers have the same view of the network topology, Dijkstra’s Algorithm and other Link State Routing algorithms are employed in order to compute shortest path to all destinations, it does not lead to persistent loop but it can result in more network traffic due to flooding link state information.

Read more about Link State Routing.

Distance Vector Routing Vs Link State Routing

Comparison between Distance Vector Routing and Link State Routing

Distance Vector Routing	Link State Routing
Bandwidth required is less due to local sharing, small packets and no flooding.	Bandwidth required is more due to flooding and sending of large link state packets.
Based on local knowledge, since it updates table based on information from neighbours.	Based on global knowledge, it have knowledge about entire network.
Make use of Bellman Ford Algorithm.	Make use of Dijakstra's algorithm.
Traffic is less.	Traffic is more.
Converges slowly i.e, good news spread fast and bad news spread slowly.	Converges faster.
Count of infinity problem.	No count of infinity problem.
Persistent looping problem i.e, loop will be there forever.	No persistent loops, only transient loops.
Practical implementation is RIP and IGRP.	Practical implementation is OSPF and ISIS.

Fixed and Flooding Routing algorithms

A

Ankit87

Improve

Article Tags :

Practice Tags :

Misc

Similar Reads

Sliding Window Protocol | Set 1 (Sender Side)

Reliable data transmission is critical in computer networking, particularly across long distances or in networks that have high latency. The Sliding Window Protocol is a critical component in obtaining this reliability. It is part of the OSI model's Data Link Layer and is used in several protocols,

What is MAC Address?

To communicate or transfer data from one computer to another, we need an address. In computer networks, various types of addresses are introduced; each works at a different layer. A MAC address, which stands for Media Access Control Address, is a physical address that works at the Data Link Layer. I

Collision Avoidance in wireless networks

We take a close look at so-called WiFi which is also known as IEEE standard 802.11 Consider the situation depicted in the figure, where each of the four nodes is able to send and receive signals that reach just the nodes to its immediate left and right. For example, B can exchange frames with A and

Difference between Unicast, Broadcast and Multicast in Computer Network

The cast term here signifies some data(stream of packets) is being transmitted to the recipient(s) from the client(s) side over the communication channel that helps them to communicate. Let's see some of the "cast" concepts that are prevailing in the computer networks field. What is Unicast?This typ

Collision Domain and Broadcast Domain in Computer Network

Prerequisite - Network Devices, Transmission Modes The most common network devices used are routers and switches. But we still hear people talking about hubs, repeaters, and bridges. Do you ever wonder why these former devices are preferred over the latter ones? One reason could be: 'because they ar

Introduction of Classful IP Addressing

An IP address is an address that has information about how to reach a specific host, especially outside the LAN. An IP address is a 32-bit unique address having an address space of 232.Classful IP addressing is a way of organizing and managing IP addresses, which are used to identify devices on a ne

IPv4 Datagram Header

IP stands for Internet Protocol and v4 stands for Version Four (IPv4). IPv4 was the primary version brought into action for production within the ARPANET in 1983. IP version four addresses are 32-bit integers which will be expressed in decimal notation. In this article, we will discuss about IPv4 da

Fragmentation at Network Layer

In computer networks, data is sent in small units called packets or datagrams. Sometimes, these datagrams are too large to pass through a network with a smaller size limit. To handle this, the datagram is broken into smaller parts is called fragmentation.IPv4 datagram can be as large as 65,535 bytes

Internet Protocol version 6 (IPv6)

The Internet Protocol version 6, or IPv6, is the latest version of the Internet Protocol (IP), which is the system used for identifying and locating computers on the Internet. IPv6 was developed by the Internet Engineering Task Force (IETF) to deal with the problem of IPv4 exhaustion. IPv6 is a 128-

Classless Addressing in IP Addressing

The Network address identifies a network on the internet.Â Using this, we can find a range of addresses in the network and total possible number of hosts in the network. Mask is a 32-bit binary number that gives the network address in the address block when AND operation is bitwise applied on the mas