Documente Academic
Documente Profesional
Documente Cultură
Computer Networks Link state routing involves five steps for a router:
o Discover its neighbors and learn their network
addresses
o Measure the delay and cost to each of its neighbors
o Construct a packet telling all it has just learnt
o Send this packet to “all” other routers of the network
NETWORK LAYER o Compute the shortest path to every other router
In this way the complete topology and all delays
are experimentally measured and distributed to all
other routers
An algorithm to find the shortest path (e.g.
Dijkstra’s Algorithm) can then be used to find the
shortest path to every other router in the
Faisal Amjad CPS 422 network Faisal Amjad CPS 422