Professional Documents
Culture Documents
Amar Taggu
Department of Computer Sc & Engineering, NERIST
DJIKSTRAS ALGORITHM:
Finds the shortest path between a source and a destination
(2,A)
B
2
1
6
3
E
(4,B)
Source = A, Destination = D
(6,E)
(10,H)
D
2
2
H
(8,F)
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
Directly Connected
Networks
Link
This is an interface on a
router
Link state
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
State of each
directly connected
link
Includes information
about neighbors such
as neighbor ID, link
type, & bandwidth
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
LINK-STATE ROUTING
Routing
protocol
Builds
Topological
map
Router can
independently
determine the
shortest path to
every network.
Convergence
A periodic/
event driven
routing updates
Use
of
LSP
Distance
vector
No
No
Slow
Generally No
No
Link State
Yes
Yes
Fast
Generally Yes
Yes
Processing Requirements
Bandwidth Requirements