Scribd
Upload
6 views10 pages

Network Routing Using Dijkstras Algorithm

The document discusses Dijkstra's algorithm and its application in efficient network routing, highlighting its purpose to find the shortest paths in graph structures formed by routers and links. It outlines the algorithm's steps, features of a simulation project, and various applications including GPS navigation and network protocols like OSPF. The simulation visualizes routing under random traffic conditions, emphasizing shortest paths and traffic delays.

Uploaded by

rvit23bis018.rvitm
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
6 views10 pages

Network Routing Using Dijkstras Algorithm

The document discusses Dijkstra's algorithm and its application in efficient network routing, highlighting its purpose to find the shortest paths in graph structures formed by routers and links. It outlines the algorithm's steps, features of a simulation project, and various applications including GPS navigation and network protocols like OSPF. The simulation visualizes routing under random traffic conditions, emphasizing shortest paths and traffic delays.

Uploaded by

rvit23bis018.rvitm
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

Network Routing

Using Dijkstra's
Algorithm
Explore how Dijkstra's algorithm powers efficient network
routing. Discover key features and visual simulation.

- Hitanshu Kumar Singh


Introduction to
Network Routing
Networks as Graphs Routing Goal
Routers as nodes and Find shortest paths to
links as edges form route data effi ciently
graph structures. across the network.

Routing Protocols
Examples: OSPF and IS-IS use algorithms for optimal path
selection.
What is Dijkstra's
Algorithm? Algorithm?
Inventor
Edsger W. Dijkstra, 1956

Purpose
Find shortest paths from one node to all others in a
graph.

Applications
Used in GPS navigation like Google Maps and network
routing.
Dijkstra's Algorithm: Step-by-
by-Step
Initialization
Set distances to infinity except source at zero;
mark all unvisited.

Iteration
Select closest unvisited node; update neighbors’
distances accordingly.

Termination
Repeat until all nodes visited or target node
distance finalized.
Project: Network Routing
Simulation
Simulate routing with random network traffic conditions.
Visualize routers and weighted links representing transmission
times.
Features of the
Project
• Random topology generation • Heavy traffic marks delays • Shortest path
• Edges show transmission >15 ms in red highlighted
delays (5 to 25 ms) • Interactive dynamically
source/destination • Real-time packet
selection via clicks movement animation
Working Flow of the
Simulation
1. Generate random graph topology
2. Select source and destination routers
3. Compute shortest path via Dijkstra’s
algorithm
4. Highlight shortest path in green
5. Show heavy traffic links in red
6. Animate packet moving from source to
destination
Visual Output
Examples
View different scenarios with varied traffic and path highlights, demonstrating dynamic routing and heavy
traffic alerts.
Applications and Use Cases

GPS Navigation Network Protocols


Used to find the shortest OSPF uses Dijkstra to
route between two calculate routes within an
locations. area.

Apps like Google Maps Ensures efficient data routing


use Dijkstra’s concept to with minimum delay across
suggest fastest paths. routers.
Thank You
Thank you for exploring Dijkstra’s algorithm and network
routing simulation.

You might also like