Link State Routing Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layerrouting-protocol/lsr-ospf-comparison/asset-link-state-routing-part-1 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Link State Routing by contrasting it with distance vector routing. The instructor explains that in link state networks, every node possesses the complete topology of the domain, including all nodes, links, and their current conditions. Each node then uses Dijkstra's algorithm to compute a unique routing table based on its specific location within that shared topology. The lecture emphasizes that the topology must be dynamic, continuously updated to reflect changes in node or link states. A hand-drawn network diagram with nodes labeled A through G is used throughout to illustrate the topology, with the instructor progressively circling nodes and annotating link costs such as 1, 2, 4, 5, and 7. The session concludes by posing the question of how a common topology can remain dynamic while being stored in each node, and clarifies that the cost associated with an edge defines the state of the link.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens with a slide titled 'Link State Routing' that contrasts the approach with distance vector routing. The instructor explains that each node in a link state network possesses the entire topology of the domain and uses Dijkstra's algorithm to build a routing table unique to its location. A network topology diagram with nodes labeled A, B, C, D, E, F, and G is displayed at the bottom of the slide. The instructor gestures toward the diagram while emphasizing that the topology must be dynamic to reflect any changes in node or link conditions. On-screen bullet points state that 'Link state routing has a different philosophy from that of distance vector routing' and that the topology must represent the latest state of each node and link.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues explaining the philosophy of link state routing, highlighting that each node has a complete topology including the type, cost (metric), and condition of all links. Using the hand-drawn network diagram with nodes A through G, the instructor progressively circles each node in red to represent the entire topology and points to specific nodes such as C with a red arrow. Handwritten link costs including 1, 2, and 4 are added to the diagram's edges. The instructor stresses that although all nodes share the same topology, each node interprets it differently to produce a unique routing table. Red underlines appear on key phrases such as 'routing table' and 'dynamic' to reinforce these concepts.

  3. 5:00 – 5:11 05:00-05:11

    A second slide appears with bullets including 'How can a common topology be dynamic and stored in each node?' and 'In this algorithm the cost associated with an edge defines the state of the link.' The instructor, wearing a black KG Knowledge Gate polo, raises his hand to gesture while speaking. The network diagram remains visible with nodes A through G circled in red and connected by lines marked with handwritten costs such as 5, 7, and 4. This transition shifts the focus from describing the topology to questioning how dynamic updates are maintained across all nodes.

The lecture establishes that link state routing differs fundamentally from distance vector routing in that every node holds a complete map of the network topology rather than merely exchanging distance information with neighbors. The central teaching point is that this shared topology, which includes node identities, link types, costs (metrics), and current conditions, is processed by Dijkstra's algorithm at each node to generate a routing table that is unique to that node's position. The instructor uses a consistent hand-drawn diagram with nodes A through G, progressively annotating it by circling nodes and writing link costs to make the abstract topology concrete. The dynamic nature of the topology is repeatedly emphasized as essential for reflecting real-time changes in link or node states. The final slide introduces the mechanism question—how a common topology remains dynamic while stored in each node—and defines the edge cost as the state of the link, setting up further discussion on update procedures.

Loading lesson…