Link State Routing Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: 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, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: 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, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…