TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
Department of Computer Science & Engineering
SUBJECT FACULTY
PRESENTED BY
Narsingam Name : Manasa. S
(Assistant Professor) Roll No: 22R91A05N1
TOPIC :
Content
1 Routing Algorithm
2 Classification of routing
algorithm
3 Adaptive routing algorithm
4 Non adaptive routing algorithm
5 Differences
…..
Routing Algorithm
• In order to transfer the packets from source to the destination, the
network layer must determine the best route through which packets
can be transmitted.
• Whether the network layer provides datagram service or virtual
circuit service, the main job of the network layer is to provide the
best route. The routing protocol provides this job.
• The routing protocol is a routing algorithm that provides the best
path from the source to the destination. The best path is the path
that has the "least-cost path" from source to the destination.
• Routing is the process of forwarding the packets from source to the
destination but the best route to send the packets is determined by
the routing algorithm.
Classification of routing
algorithm
The Routing algorithm is divided into two categories:
• Adaptive Routing algorithm
• Non-adaptive Routing algorithm
Adaptive routing
algorithm
• An adaptive routing algorithm is also known as dynamic routing algorithm.
• This algorithm makes the routing decisions based on the topology and
network traffic.
• The main parameters related to this algorithm are hop count, distance and
estimated transit time.
An adaptive routing algorithm can be classified into three parts:
• Centralized algorithm: It is also known as global routing algorithm as it
computes the least-cost path between source and destination by using
complete and global knowledge about the network.
• Isolation algorithm: It is an algorithm that obtains the routing information
by using local information rather than gathering information from other
nodes.
• Distributed algorithm: It is also known as decentralized algorithm as it
computes the least-cost path between source and destination in an iterative
and distributed manner.
Non adaptive routing
algorithm
• Non Adaptive routing algorithm is also known as a static routing
algorithm.
• When booting up the network, the routing information stores to the
routers.
• Non Adaptive routing algorithms do not take the routing decision
based on the network topology or network traffic.
The Non-Adaptive Routing algorithm is of two types:
Flooding: In case of flooding, every incoming packet is sent to all
the outgoing links except the one from it has been reached. The
disadvantage of flooding is that node may contain several copies of
a particular packet.
Random walks: In case of random walks, a packet sent by the
node to one of its neighbors randomly. An advantage of using
random walks is that it uses the alternative routes very efficiently.
Differences
Basis Of Comparison Adaptive Routing Non-Adaptive Routing
algorithm algorithm
Adaptive Routing The Non-Adaptive Routing
algorithm is an algorithm algorithm is an algorithm
Define that constructs the routing that constructs the static
table based on the table to determine which
network conditions. node to send the packet.
Adaptive routing The Non-Adaptive Routing
Usage algorithm is used by algorithm is used by static
dynamic routing. routing.
Routing decisions are
Routing decisions are the
Routing decision made based on topology
static tables.
and network traffic.
The types of adaptive The types of Non Adaptive
routing algorithm, are routing algorithm are
Categorization
Centralized, isolation and flooding and random
distributed algorithm. walks.
Adaptive Routing
Non-Adaptive Routing
Complexity algorithms are more
algorithms are simple.
complex.
