Routing Algorithm:Properties,Types,Adaptive (Centralized, Isolation, Distributed) | Computer Science

Practice Computer Science and complete notes:

Chapters:
0:00 Routing Algorithm
1:15 What is a Router?
2:37 Why Routers?
3:50 Two Processes of Router
4:57 Properties in Routing Algorithm
7:00 Types of Routing Algorithm
8:17 Classification of Adaptive Routing
9:53 Non Adaptive Routing Algorithm
10:33 Classification of Non-Adaptive Routing
11:37 Distance Vector Routing
12:48 Routing Table
13:15 MCQ about Routing Algorithm

# What is a router?
# Why Routers?
# Router’s two process
# Properties of Routing Algorithm
# Types of Routing Algorithm
# Adaptive Routing Algorithm
# Centralized Algorithm
# Isolation Algorithm
# Distributed Algorithm. Non Adaptive Routing Algorithm
# Flooding
# Random Walk
# Distance Vector Routing
# MCQ

Classification of Adaptive Routing
2. Isolation algorithm: In this routing is decided by using local information rather than global information.
3. Distributed Algorithm: It computes least cost path based on iterative and distributed manner from source to destination.
It is also known as decentralized algorithm.
Distance Vector algorithm is the example of decentralized algorithm.
Initially the current node knows only the information about its own directly attached links, based on iterative process it computes least cost path to the destination.
Non Adaptive Routing Algorithm.
Non- Adaptive routing : It’s also known as static routing algorithm.
Routing process will be designed in advance. The way in which the packet reaches to the destination is set in advance in routing process.
When the booting completes all the routing process will be stored in routers, so the router will blindly follows this routing process. In between the transmission the router does not change their routing process.
It is not based on Topology or network traffic . so any changes occur in network traffic or topology does not effect on routing process.

Classification of Non-Adaptive Routing
Classified in two ways:
Flooding : In this all the incoming packets will be transmitted to all the outgoing links except the router or the link which it’s received. So the multiple copies of the packet can be made to the node.
For ex:
Classification of Non-Adaptive Routing
Random Walks: In case of random walks, all the incoming packets will be transmitted to the neighbour links randomly. So, it will not send every packet to the outgoing link.
This process is best for setting alternative path.
Random Walk is efficient than flooding.
Distance Vector Routing
The distance vector routing is a adaptive or Dynamic algorithm. It is also known as Bellman-Ford or Distributed Bellman-Ford Routing Algorithm.
It nature is iterative , distributed and asynchronous.
Each and every Router maintains a table i.e. Known as “VECTOR”. Tables basically contains either a distance(Hop-Hop) or delay.
The main key points is:
Knowledge about the whole network: The router sends whole of its knowledge to its neighbours.
Routing only to neighbours: Tables update their information with the help of exchanging information with the routers(neighbours). The router sends its information to only those routers who have direct links .
Information sharing to regular intervals: Every router sends information to the neighbouring links(routers) in few seconds of interval.
Every router knows the best distance to reach the another router.

Routing Table
Routing table contains two process:
Creating table
Updating table
Creating Table: It has three parts
Network Id: It defines the destination of the packet.
Cost: Cost should be minimum and no. of intermediate nodes should be minimum.
Next hop: Next hop contains information about the router to which packet must be delivered.
Updating table: means how the packet should go to the one hop to next (router to router). #ugcnet #doorsteptutor #examrace