4.11 - Link State Routing Algorithm
This video describes about Link-State (LS) Routing Algorithm (Dijkstra’s algorithm) with example.
"Link State Routing Algorithm:
Each node independently runs an algorithm over the map to determine the shortest path from itself to every other node in the network; generally some variant of Dijkstra's algorithm is used.
This is based around a link cost across each path which includes available bandwidth among other things.
Dijkstra’s algorithm computes the least-cost path from one node (the source, which we will refer to as u) to all other nodes in the network.
Dijkstra’s algorithm is iterative and has the property that after the kth iteration of the algorithm, the least-cost paths are known to k destination nodes, and among the least-cost paths to all destination nodes, these k paths will have the k smallest costs.
GTU - Computer Engineering (CE) - Semester 4 - 2140709 - Computer Networks - Network Layer - Link State Routing Algorithm
Computer Networks PPTs are available here: http://www.darshan.ac.in/DIET/CE/GTU-...
This video is recorded by Prof. Maulik Trivedi ([email protected], +91-9998265805) at Computer Engineering Department of Darshan Institute of Engineering & Technology, Rajkot as per GTU Syllabus.
Darshan Institute of Engineering & Technology, Rajkot is a leading institute offering undergraduate, graduate and postgraduate programs in engineering. The Institute is affiliated to the Gujarat Technological University (GTU) and approved by the AICTE, New Delhi.
Visit us: http://www.darshan.ac.in
Write us: [email protected]
Facebook: / darshaninstitute.official
Twitter: / darshan_inst
Instagram: / darshan_inst
