Link State Routing Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/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. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
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…