Difference between Distance vector routing

and Link State routing

Routing, a process in computer networks, is responsible for the best path to
transmit data packets from one node to another, Distance Vector
Routing and Link State Routing are two of the most prominent dynamic
routing algorithms, they each have their own procedures for calculating
routes and disseminating information about those routes throughout a
network, consequently, grasping their characteristics and differences
becomes important for network engineers when coming up with efficient and
resilient networks.
What is 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 employs
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.

What is 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.
Comparison between Distance Vector Routing and Link State Routing
Distance Vector Routing Link State Routing

Bandwidth required is more due to

Bandwidth required is less due to local
flooding and sending of large link
sharing, small packets and no flooding.
state packets.

Based on local knowledge, since it

Based on global knowledge, it have
updates table based on information
knowledge about entire network.
from neighbours.

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 Converges faster.
slowly.

Count of infinity problem. No count of infinity problem.

Persistent looping problem i.e, loop will No persistent loops, only transient
be there forever. loops.

Practical implementation is RIP and Practical implementation is OSPF

IGRP. and ISIS.

Congestion Control in Computer Networks

Congestion control is a crucial concept in computer networks. It refers to the
methods used to prevent network overload and ensure smooth data flow.
When too much data is sent through the network at once, it can cause
delays and data loss. Congestion control techniques help manage the traffic,
so all users can enjoy a stable and efficient network connection. These
techniques are essential for maintaining the performance and reliability of
modern networks.
What is Congestion?
Congestion in a computer network happens when there is too much data
being sent at the same time, causing the network to slow down. Just like
traffic congestion on a busy road, network congestion leads to delays and
sometimes data loss. When the network can’t handle all the incoming data, it
gets “clogged,” making it difficult for information to travel smoothly from one
place to another.
Effects of Congestion in Computer Network
 Improved Network Stability: Congestion control helps keep the network
stable by preventing it from getting overloaded. It manages the flow of
data so the network doesn’t crash or fail due to too much traffic.
 Reduced Latency and Packet Loss: Without congestion control, data
transmission can slow down, causing delays and data loss. Congestion
control helps manage traffic better, reducing these delays and ensuring
fewer data packets are lost, making data transfer faster and the network
more responsive.
 Enhanced Throughput: By avoiding congestion, the network can use its
resources more effectively. This means more data can be sent in a
shorter time, which is important for handling large amounts of data and
supporting high-speed applications.
 Fairness in Resource Allocation: Congestion control ensures that
network resources are shared fairly among users. No single user or
application can take up all the bandwidth, allowing everyone to have a fair
share.
 Better User Experience: When data flows smoothly and quickly, users
have a better experience. Websites, online services, and applications
work more reliably and without annoying delays.
 Mitigation of Network Congestion Collapse: Without congestion
control, a sudden spike in data traffic can overwhelm the network, causing
severe congestion and making it almost unusable. Congestion control
helps prevent this by managing traffic efficiently and avoiding such critical
breakdowns.
Congestion Control Algorithm
 Congestion Control is a mechanism that controls the entry of data packets
into the network, enabling a better use of a shared network infrastructure
and avoiding congestive collapse.
 Congestive-avoidance algorithms (CAA) are implemented at the TCP
layer as the mechanism to avoid congestive collapse in a network.
 There are two congestion control algorithms which are as follows:
Leaky Bucket Algorithm
 The leaky bucket algorithm discovers its use in the context of network
traffic shaping or rate-limiting.
 A leaky bucket execution and a token bucket execution are predominantly
used for traffic shaping algorithms.
 This algorithm is used to control the rate at which traffic is sent to the
network and shape the burst traffic to a steady traffic stream.
 The disadvantages compared with the leaky-bucket algorithm are the
inefficient use of available network resources.
 The large area of network resources such as bandwidth is not being used
effectively.
Let us consider an example to understand Imagine a bucket with a small
hole in the bottom. No matter at what rate water enters the bucket, the
outflow is at constant rate. When the bucket is full with water additional water
entering spills over the sides and is lost.

Similarly, each network interface contains a leaky bucket and the following
steps are involved in leaky bucket algorithm:
 When host wants to send packet, packet is thrown into the bucket.
 The bucket leaks at a constant rate, meaning the network interface
transmits packets at a constant rate.
 Bursty traffic is converted to a uniform traffic by the leaky bucket.
 In practice the bucket is a finite queue that outputs at a finite rate.
Token Bucket Algorithm
 The leaky bucket algorithm has a rigid output design at an average rate
independent of the bursty traffic.
 In some applications, when large bursts arrive, the output is allowed to
speed up. This calls for a more flexible algorithm, preferably one that
never loses information. Therefore, a token bucket algorithm finds its uses
in network traffic shaping or rate-limiting.
 It is a control algorithm that indicates when traffic should be sent. This
order comes based on the display of tokens in the bucket.
 The bucket contains tokens. Each of the tokens defines a packet of
predetermined size. Tokens in the bucket are deleted for the ability to
share a packet.
 When tokens are shown, a flow to transmit traffic appears in the display of
tokens.
 No token means no flow sends its packets. Hence, a flow transfers traffic
up to its peak burst rate in good tokens in the bucket.
To learn more about Token Bucket Algorithm please refer the article.
Need of Token Bucket Algorithm
The leaky bucket algorithm enforces output pattern at the average rate, no
matter how bursty the traffic is. So in order to deal with the bursty traffic we
need a flexible algorithm so that the data is not lost. One such algorithm is
token bucket algorithm.
Steps of this algorithm can be described as follows:
 In regular intervals tokens are thrown into the bucket. ƒ
 The bucket has a maximum capacity. ƒ
 If there is a ready packet, a token is removed from the bucket, and the
packet is sent.
 If there is no token in the bucket, the packet cannot be sent.
Let’s understand with an example, In figure (A) we see a bucket holding
three tokens, with five packets waiting to be transmitted. For a packet to be
transmitted, it must capture and destroy one token. In figure (B) We see that
three of the five packets have gotten through, but the other two are stuck
waiting for more tokens to be generated.
Token Bucket vs Leaky Bucket
The leaky bucket algorithm controls the rate at which the packets are
introduced in the network, but it is very conservative in nature. Some
flexibility is introduced in the token bucket algorithm. In the token bucket
algorithm, tokens are generated at each tick (up to a certain limit). For an
incoming packet to be transmitted, it must capture a token and the
transmission takes place at the same rate. Hence some of the busty packets
are transmitted at the same rate if tokens are available and thus introduces
some amount of flexibility in the system.
Formula: M * s = C + ? * s where S – is time taken M – Maximum output rate
? – Token arrival rate C – Capacity of the token bucket in byte
Let’s understand with an example,

Link to question on leaky bucket

algorithm: https://www.geeksforgeeks.org/computer-networks-set-8/
Advantages
 Stable Network Operation: Congestion control ensures that networks
remain stable and operational by preventing them from becoming
overloaded with too much data traffic.
 Reduced Delays: It minimizes delays in data transmission by managing
traffic flow effectively, ensuring that data packets reach their destinations
promptly.
 Less Data Loss: By regulating the amount of data in the network at any
given time, congestion control reduces the likelihood of data packets
being lost or discarded.
 Optimal Resource Utilization: It helps networks use their resources
efficiently, allowing for better throughput and ensuring that users can
access data and services without interruptions.
 Scalability: Congestion control mechanisms are scalable, allowing
networks to handle increasing volumes of data traffic as they grow without
compromising performance.
 Adaptability: Modern congestion control algorithms can adapt to
changing network conditions, ensuring optimal performance even in
dynamic and unpredictable environments.
Disadvantages
 Complexity: Implementing congestion control algorithms can add
complexity to network management, requiring sophisticated systems and
configurations.
 Overhead: Some congestion control techniques introduce additional
overhead, which can consume network resources and affect overall
performance.
 Algorithm Sensitivity: The effectiveness of congestion control algorithms
can be sensitive to network conditions and configurations, requiring fine-
tuning for optimal performance.
 Resource Allocation Issues: Fairness in resource allocation , while a
benefit, can also pose challenges when trying to prioritize critical
applications over less essential ones.
 Dependency on Network Infrastructure: Congestion control relies on
the underlying network infrastructure and may be less effective in
environments with outdated or unreliable equipment.
Conclusion
Congestion control is essential for keeping computer networks running
smoothly. It helps prevent network overloads by managing the flow of data,
ensuring that information gets where it needs to go without delays or loss.
Effective congestion control improves network performance and reliability,
making sure that users have a stable and efficient connection. By using
these techniques, networks can handle high traffic volumes and continue to
operate effectively.