Link State Routing Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/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 the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
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…