SlideShare a Scribd company logo
2
Most read
3
Most read
12
Most read
PRESENTATIONTOPIC
ROUTING ALGORITHM
Link State
DistanceVector
Group Member
BASIT HUSSAIN | 2017-CS-126
HAMZA KHAN | 2017-CS-105
IRTEZA HASSAN | 2017-CS-50
Router
• A router has two processes inside it.
• One of them handles each packet as it arrives, looking up the outgoing line
to use for it in the router tables.This process is forwarding.
• The other process is responsible for filling in and updating the routing
tables.That is where the routing algorithm comes into play.
Router
Router
Router 3
Router 1
Router 2
Routing Algorithm
• Part of the network layer responsible for deciding which output line an
incoming packet should be transmitted on.
• If the network uses datagrams internally, this decision must be made a new
path for every arriving data packet.
• If the network uses virtual circuits internally, routing decisions are made
only when a new virtual circuit is being set up.This case sometimes called
session routing.
Routing Example
• Routing = building maps and giving directions
Desired Properties of Routing Algorithm
• Correctness
• Simplicity
• Robustness
• Stability
• Fairness and Efficiency
Types of Routing Algorithms
• Non-Adaptive or Static Algorithm
Routing paths are computed in advance, offline, and downloaded to the routers when the
network is booted. It does not respond to failures.
• Adaptive or Dynamic Algorithm
Change their routing decisions to reflect changes in the topology, and sometimes
changes in the traffic.
Routing Algorithms
• Shortest Path Algorithm
• Flooding
• DistanceVector Routing
• Link State Routing
• Hierarchical Routing
• Broadcast Routing
• Multicast Routing
• Anycast Routing
DistanceVector Routing
• It’s a Adaptive or Dynamic Algorithm.
• Each Router Maintains a table called “Vector”.
• Table has the Best Known Distance for Each Routers.
• Tables are Updated by exchanging Information with neighbors(Router).
• Each Router knows the Best Distance to Reach another Router.
• Also Known as Bellman-Ford Routing Algorithm.
DistanceVector Routing
• Each Router’sTable has one entry for one router.
• This entry has two parts.
• Preferred out going Line for each Router.
• Estimated distance to destination Router.
• Distance is basically considered by no’s of Hops.
• Delays basically measured by sending ECHO packets to another Router.
A
E
I J K L
H
D
F
B C
G
0
12
25
40
14
23
18
17
29
24
21
9
24
36
18
27
7
20
31
20
33
22
0
11
20
31
19
8
30
19
6
0
9
22
14
7
21
28
36
24
22
40
31
19
9
0
22
10
8
20
28
20
17
30
18
12
15
6
10
0
A
A
I
H
I
I
H
H
K
K
I
-
A
B
C
D
E
F
G
H
L
K
I
J
A I H K J Line
JA Delay is 8
JI Delay is 10
JH Delay is 12
JK Delay is 6
NewRoutingTableforRouterJ
Advantages & Disadvantages
• Advantages of DistanceVector routing –
• It is simpler to configure and maintain than link state routing.
• Disadvantages of DistanceVector routing –
• It is slower to converge than link state.
• It is at risk from the count-to-infinity problem.
• It creates more traffic than link state since a hop count change must be propagated to all routers and
processed on each router. Hop count updates take place on a periodic basis, even if there are no
changes in the network topology, so bandwidth-wasting broadcasts still occur.
• For larger networks, distance vector routing results in larger routing tables than link state since each
router must know about all other routers.This can also lead to congestion onWAN links.
Link State Routing Algorithm
Why?
• DistanceVector Routing algorithm often took too long converge after the
network topology changed (due to the count-to-infinity problem).
Link State Routing Algorithm
Idea Behind Link State Routing
• This has five parts
1. Discovery its neighbors and learn their network addresses.
2. Set the distance or cost metric to each of its neighbors.
3. Construct a packet telling all it has just learned.
4. Send this packet to and receive packets from all other routers.
5. Compute the shortest path to every other router.
Link State Routing Algorithm
Learning About Neighbors
A
E
A
E
A
A
E
A
A A
E
A
E
A
A
E
A
A
N
Broadcast LAN
Graph Model
Link State Routing Algorithm
Setting Link Cost
• Each link to have a distance or cost metric for finding shortest paths.
• For example, 1-Gbps Ethernet may have a cost of 1 and 100-Mbps Ethernet a cost of 10.
• Higher capacity paths are the better choices.
• The most direct way to determine this delay is to send over the line a special ECHO packet
that the other side is required to send back immediately.
• The round-trip time and driving it by two, the sending router can get a reasonable estimate
of the delay.
Advantages and disadvantages of link-state
routing
• Advantage:
1. Routers have direct knowledge of all links in the network and how they are connected.
2. Link-state protocols require less router processor power than distance vector protocols.
3. The topology database eliminates the need for a routing table
• Disadvantage:
1. The necessary databases require more memory than a distance vector protocol requires.
2. The complex algorithm requires more CPU time than a distance vector protocol requires.
Link State Routing Algorithm
Building Link State Packet
B C
D
FE
A
8
7
3
2
4
5
61
Link State Routing Algorithm
• Sequence Packet: Each packet contains a sequence no., this keep tracks
how many times this packet has sent.
• Age Packet: Show the life of a packet in Network, after passing by one Hop
it is decremented by one.
• When to build Link State packets?
 Build them periodically at regular intervals.
 Build them when some significant event occurs.
Link State Routing Algorithm
Link State Protocols
• IS-IS(Intermediate System – Intermediate System)
• OSPF(Open Shortest Path First)
The End

More Related Content

PPTX
Routing algorithm
PPTX
Congestion control
PPTX
Link state routing protocol
PPTX
Routing algorithm
PDF
Link state protocols.ppt
PPTX
Multiplexing
PDF
S81-HS Panel Presentation
PPT
Routing algorithm network layer
Routing algorithm
Congestion control
Link state routing protocol
Routing algorithm
Link state protocols.ppt
Multiplexing
S81-HS Panel Presentation
Routing algorithm network layer

What's hot (20)

PPTX
Network Layer
PPTX
Network layer - design Issues
PPTX
Computer network switching
PPT
Unit 3 Network Layer PPT
PPTX
Bridging in Networking
PPTX
Framing in data link layer
PDF
Multiplexing
PPT
Chapter 1: Introduction to Data Communication and Networks
PPTX
The medium access sublayer
PPT
Flow & Error Control
PPTX
switching techniques in data communication and networking
PPTX
Network software
PPTX
Destination Sequenced Distance Vector Routing (DSDV)
PDF
Transport layer services
PPT
Network Layer,Computer Networks
PPTX
Routing protocols
PDF
Stop and-wait protocol
PPTX
WIRELESS TRANSMISSION
PPT
Switching
Network Layer
Network layer - design Issues
Computer network switching
Unit 3 Network Layer PPT
Bridging in Networking
Framing in data link layer
Multiplexing
Chapter 1: Introduction to Data Communication and Networks
The medium access sublayer
Flow & Error Control
switching techniques in data communication and networking
Network software
Destination Sequenced Distance Vector Routing (DSDV)
Transport layer services
Network Layer,Computer Networks
Routing protocols
Stop and-wait protocol
WIRELESS TRANSMISSION
Switching
Ad

Similar to Presentation Routing algorithm (20)

PPTX
Routing algorithms mehodology materials doc1
PPTX
Module 3 Part B - computer networks module 2 ppt
PPTX
Computer Networks-Network layer Concepts
PPTX
ROUTING PROTOCOLS new.pptx
PPTX
PPTX
computer communications
PPT
Chapter07
PPTX
PPTX
NETWORK LAYER PRESENTATION IP ADDRESSING UNIT-3.pptx
PPT
Network layer
PPTX
Routing Presentation
PDF
Lecture number 5 Theory.pdf(machine learning)
PPT
Day 9 routing
PDF
Core-Stateless Fair Queueing
PPTX
Computer networks unit iii
PPTX
Routing protocols
PPTX
Routing algorithms
PPTX
Fundamental concepts of Routing in detiled
PPT
NETWORK LAYER.ppt
Routing algorithms mehodology materials doc1
Module 3 Part B - computer networks module 2 ppt
Computer Networks-Network layer Concepts
ROUTING PROTOCOLS new.pptx
computer communications
Chapter07
NETWORK LAYER PRESENTATION IP ADDRESSING UNIT-3.pptx
Network layer
Routing Presentation
Lecture number 5 Theory.pdf(machine learning)
Day 9 routing
Core-Stateless Fair Queueing
Computer networks unit iii
Routing protocols
Routing algorithms
Fundamental concepts of Routing in detiled
NETWORK LAYER.ppt
Ad

Recently uploaded (20)

PDF
Which alternative to Crystal Reports is best for small or large businesses.pdf
PDF
Digital Strategies for Manufacturing Companies
PPTX
What to Capture When It Breaks: 16 Artifacts That Reveal Root Causes
PPTX
Agentic AI : A Practical Guide. Undersating, Implementing and Scaling Autono...
PDF
How to Confidently Manage Project Budgets
PPTX
Mastering-Cybersecurity-The-Crucial-Role-of-Antivirus-Support-Services.pptx
PPTX
CHAPTER 12 - CYBER SECURITY AND FUTURE SKILLS (1) (1).pptx
PPTX
AIRLINE PRICE API | FLIGHT API COST |
PDF
Build Multi-agent using Agent Development Kit
PPTX
Transform Your Business with a Software ERP System
PDF
top salesforce developer skills in 2025.pdf
PDF
Why TechBuilder is the Future of Pickup and Delivery App Development (1).pdf
PDF
PTS Company Brochure 2025 (1).pdf.......
PPTX
Online Work Permit System for Fast Permit Processing
PPTX
Materi_Pemrograman_Komputer-Looping.pptx
PPT
Introduction Database Management System for Course Database
PDF
QAware_Mario-Leander_Reimer_Architecting and Building a K8s-based AI Platform...
PPTX
L1 - Introduction to python Backend.pptx
PDF
A REACT POMODORO TIMER WEB APPLICATION.pdf
PDF
2025 Textile ERP Trends: SAP, Odoo & Oracle
Which alternative to Crystal Reports is best for small or large businesses.pdf
Digital Strategies for Manufacturing Companies
What to Capture When It Breaks: 16 Artifacts That Reveal Root Causes
Agentic AI : A Practical Guide. Undersating, Implementing and Scaling Autono...
How to Confidently Manage Project Budgets
Mastering-Cybersecurity-The-Crucial-Role-of-Antivirus-Support-Services.pptx
CHAPTER 12 - CYBER SECURITY AND FUTURE SKILLS (1) (1).pptx
AIRLINE PRICE API | FLIGHT API COST |
Build Multi-agent using Agent Development Kit
Transform Your Business with a Software ERP System
top salesforce developer skills in 2025.pdf
Why TechBuilder is the Future of Pickup and Delivery App Development (1).pdf
PTS Company Brochure 2025 (1).pdf.......
Online Work Permit System for Fast Permit Processing
Materi_Pemrograman_Komputer-Looping.pptx
Introduction Database Management System for Course Database
QAware_Mario-Leander_Reimer_Architecting and Building a K8s-based AI Platform...
L1 - Introduction to python Backend.pptx
A REACT POMODORO TIMER WEB APPLICATION.pdf
2025 Textile ERP Trends: SAP, Odoo & Oracle

Presentation Routing algorithm

  • 2. Group Member BASIT HUSSAIN | 2017-CS-126 HAMZA KHAN | 2017-CS-105 IRTEZA HASSAN | 2017-CS-50
  • 3. Router • A router has two processes inside it. • One of them handles each packet as it arrives, looking up the outgoing line to use for it in the router tables.This process is forwarding. • The other process is responsible for filling in and updating the routing tables.That is where the routing algorithm comes into play.
  • 5. Routing Algorithm • Part of the network layer responsible for deciding which output line an incoming packet should be transmitted on. • If the network uses datagrams internally, this decision must be made a new path for every arriving data packet. • If the network uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being set up.This case sometimes called session routing.
  • 6. Routing Example • Routing = building maps and giving directions
  • 7. Desired Properties of Routing Algorithm • Correctness • Simplicity • Robustness • Stability • Fairness and Efficiency
  • 8. Types of Routing Algorithms • Non-Adaptive or Static Algorithm Routing paths are computed in advance, offline, and downloaded to the routers when the network is booted. It does not respond to failures. • Adaptive or Dynamic Algorithm Change their routing decisions to reflect changes in the topology, and sometimes changes in the traffic.
  • 9. Routing Algorithms • Shortest Path Algorithm • Flooding • DistanceVector Routing • Link State Routing • Hierarchical Routing • Broadcast Routing • Multicast Routing • Anycast Routing
  • 10. DistanceVector Routing • It’s a Adaptive or Dynamic Algorithm. • Each Router Maintains a table called “Vector”. • Table has the Best Known Distance for Each Routers. • Tables are Updated by exchanging Information with neighbors(Router). • Each Router knows the Best Distance to Reach another Router. • Also Known as Bellman-Ford Routing Algorithm.
  • 11. DistanceVector Routing • Each Router’sTable has one entry for one router. • This entry has two parts. • Preferred out going Line for each Router. • Estimated distance to destination Router. • Distance is basically considered by no’s of Hops. • Delays basically measured by sending ECHO packets to another Router.
  • 12. A E I J K L H D F B C G 0 12 25 40 14 23 18 17 29 24 21 9 24 36 18 27 7 20 31 20 33 22 0 11 20 31 19 8 30 19 6 0 9 22 14 7 21 28 36 24 22 40 31 19 9 0 22 10 8 20 28 20 17 30 18 12 15 6 10 0 A A I H I I H H K K I - A B C D E F G H L K I J A I H K J Line JA Delay is 8 JI Delay is 10 JH Delay is 12 JK Delay is 6 NewRoutingTableforRouterJ
  • 13. Advantages & Disadvantages • Advantages of DistanceVector routing – • It is simpler to configure and maintain than link state routing. • Disadvantages of DistanceVector routing – • It is slower to converge than link state. • It is at risk from the count-to-infinity problem. • It creates more traffic than link state since a hop count change must be propagated to all routers and processed on each router. Hop count updates take place on a periodic basis, even if there are no changes in the network topology, so bandwidth-wasting broadcasts still occur. • For larger networks, distance vector routing results in larger routing tables than link state since each router must know about all other routers.This can also lead to congestion onWAN links.
  • 14. Link State Routing Algorithm Why? • DistanceVector Routing algorithm often took too long converge after the network topology changed (due to the count-to-infinity problem).
  • 15. Link State Routing Algorithm Idea Behind Link State Routing • This has five parts 1. Discovery its neighbors and learn their network addresses. 2. Set the distance or cost metric to each of its neighbors. 3. Construct a packet telling all it has just learned. 4. Send this packet to and receive packets from all other routers. 5. Compute the shortest path to every other router.
  • 16. Link State Routing Algorithm Learning About Neighbors A E A E A A E A A A E A E A A E A A N Broadcast LAN Graph Model
  • 17. Link State Routing Algorithm Setting Link Cost • Each link to have a distance or cost metric for finding shortest paths. • For example, 1-Gbps Ethernet may have a cost of 1 and 100-Mbps Ethernet a cost of 10. • Higher capacity paths are the better choices. • The most direct way to determine this delay is to send over the line a special ECHO packet that the other side is required to send back immediately. • The round-trip time and driving it by two, the sending router can get a reasonable estimate of the delay.
  • 18. Advantages and disadvantages of link-state routing • Advantage: 1. Routers have direct knowledge of all links in the network and how they are connected. 2. Link-state protocols require less router processor power than distance vector protocols. 3. The topology database eliminates the need for a routing table • Disadvantage: 1. The necessary databases require more memory than a distance vector protocol requires. 2. The complex algorithm requires more CPU time than a distance vector protocol requires.
  • 19. Link State Routing Algorithm Building Link State Packet B C D FE A 8 7 3 2 4 5 61
  • 20. Link State Routing Algorithm • Sequence Packet: Each packet contains a sequence no., this keep tracks how many times this packet has sent. • Age Packet: Show the life of a packet in Network, after passing by one Hop it is decremented by one. • When to build Link State packets?  Build them periodically at regular intervals.  Build them when some significant event occurs.
  • 21. Link State Routing Algorithm Link State Protocols • IS-IS(Intermediate System – Intermediate System) • OSPF(Open Shortest Path First)