KEMBAR78
Least Cost Routing Algorithm | PDF
Scribd
Upload
308 views7 pages

Least Cost Routing Algorithm

The document discusses the Least Cost Routing Algorithm, a network routing technique that identifies the most efficient path based on cost metrics such as distance and delay. It highlights common algorithms like Dijkstra's and Bellman-Ford, which aim to minimize routing costs. The application of these algorithms is crucial for efficient network traffic distribution in modern internet and enterprise designs.

Uploaded by

Memefied World
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
308 views7 pages

Least Cost Routing Algorithm

The document discusses the Least Cost Routing Algorithm, a network routing technique that identifies the most efficient path based on cost metrics such as distance and delay. It highlights common algorithms like Dijkstra's and Bellman-Ford, which aim to minimize routing costs. The application of these algorithms is crucial for efficient network traffic distribution in modern internet and enterprise designs.

Uploaded by

Memefied World
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/ 7

PRESTIGE INSTITUTE OF

MANAGEMENT & RESEARCH


NAME: ABHILESH SINGH LODHI
ENROLLMENT NO.: 0198CS221003
SUBJECT: COMPUTER NETWORKS
TOPIC: Least Cost Routing Algorithm
SEMESTER: VI
SUBMITTED TO: Mrs. POOJA MAM
What is Least Cost Routing?
• - Network routing technique to find the most
efficient path
• - Chooses routes based on cost metrics like
distance, delay, or bandwidth
• - Ensures optimal use of network resources
• - Common in dynamic and adaptive routing
protocols
Cost Metrics Used in Routing
• - Hop Count
• - Bandwidth
• - Delay
• - Load
• - Reliability
• - Each link is assigned a cost, and routers
calculate paths accordingly
Common Least Cost Routing Algorithms
• - Dijkstra's Algorithm: Finds shortest path
using a priority queue
• - Bellman-Ford Algorithm: Used in distance
vector routing
• - Both algorithms aim to minimize the total
cost of routing
Dijkstra's Algorithm Overview
• - Starts from the source node
• - Maintains a set of nodes with known
shortest distances
• - Iteratively updates path costs to neighbors
• - Guarantees the shortest path in weighted
graphs without negative cycles
Applications and Summary
• - Used in OSPF and IS-IS routing protocols
• - Ensures efficient network traffic distribution
• - Helps avoid congested or failed routes
• - Key to modern internet and enterprise
network design
THANK YOU…

You might also like