[go: up one dir, main page]
Scribd
Upload
17 views10 pages

Introduction To Routing Algorithms

This document introduces routing algorithms, explaining the role of routers in forwarding data packets between networks and directing traffic based on IP addresses. It outlines network routing as the process of selecting efficient paths for data transmission and distinguishes between static and dynamic routing. Additionally, it describes the Distance Vector Algorithm used in dynamic routing, detailing its operational steps and the iterative process of updating routing tables.

Uploaded by

gooogly755
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views10 pages

Introduction To Routing Algorithms

This document introduces routing algorithms, explaining the role of routers in forwarding data packets between networks and directing traffic based on IP addresses. It outlines network routing as the process of selecting efficient paths for data transmission and distinguishes between static and dynamic routing. Additionally, it describes the Distance Vector Algorithm used in dynamic routing, detailing its operational steps and the iterative process of updating routing tables.

Uploaded by

gooogly755
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

INTRODUCTION TO

ROUTING
ALGORITHMS
WHAT IS A ROUTER?
WHAT IS ROUTER?
1. It is a networking device that forwards data
packets between computer networks. Also, it
helps to direct traffic based on the destination IP
address.
2. It ensures that data reaches its intended
destination.
WHAT IS NETWORK
ROUTING?
WHAT IS NETWORK
ROUTING?
Routing is the process of selecting the most efficient path for data
packets to travel from a source device to a destination device
across interconnected networks.
TYPES OF ROUTING

1. Static Routing
Definition: Routes are manually configured by network
administrators and remain unchanged unless manually updated.
2. Dynamic Routing
Definition: Routes are determined and updated automatically
using routing protocols based on the current state of the network.
DISTANCE VECTOR ALGORITHM
(DYNAMIC ROUTING)

The Distance Vector Algorithm is a fundamental technique used


in network routing protocols to determine the best paths for data to
travel through a network.
It relies on iterative calculations where routers exchange distance
vectors (tables of distances to various destinations) with their
neighbors.
WORKING OF ALGORITHM

1) Each router initializes its distance vector table with direct


connections (neighbors) and sets other routes to infinity.
2) Routers exchange their tables with neighboring routers
periodically.
3) Updates are made using the Bellman-Ford algorithm, where
the shortest distance to a destination is selected based on
neighbors' tables.
4) The process continues iteratively until all routers converge on
stable routing tables.
SOLVED EXAMPLE
END

You might also like