Link State Routing Part-2

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-computer-networks/net-layerrouting-protocol/lsr-ospf-comparison/asset-link-state-routing-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
  26. Full Length Mock Test – General + Computer Science:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment, titled Link State Routing Part-2, explains how routers build routing tables using link state protocols. The instructor presents a slide titled “Building Routing Tables” that lists four core actions: each node creates link state packets (LSPs) describing its links, disseminates those LSPs to all other routers through flooding, forms a shortest path tree for each node, and calculates the routing table from that tree. A network diagram with nodes A through G is used throughout, accompanied by per-node cost tables that are highlighted and circled in red to show the link state information each router collects. The lesson then transitions to Dijkstra’s algorithm, introduced as the method for forming the shortest path tree. A slide pairs “a. The weighted graph” with “b. Link state database,” showing how the network topology and cost matrix feed into the algorithm. The Dijkstra slide defines tentative and permanent sets, includes a legend distinguishing root node, nodes in path, nodes not yet in the path, potential paths, and final paths, and walks through an Initialization diagram followed by Iteration 1 through Iteration 6. Each iteration updates cumulative costs for nodes A–G, demonstrating how the algorithm progressively fixes shortest paths from a root node. The final portion revisits the Building Routing Tables slide with red underlines on “link state packet (LSP)” and “flooding, in an efficient and reliable way,” and a red X drawn over an edge to illustrate link state changes. The overall teaching flow moves from the high-level four-step process, to the data structures involved (LSPs and LSDB), to a concrete step-by-step Dijkstra execution on the example graph.

Chapters

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

    The instructor introduces the slide “Building Routing Tables,” which lists four numbered actions for link state routing: creation of link state packets (LSPs) by each node, dissemination of LSPs to every other router via flooding, formation of a shortest path tree for each node, and calculation of the routing table from that tree. A network diagram with nodes A through G is displayed alongside per-node cost tables, and the instructor points to the term “link state packet” with a red arrow. The on-screen text includes phrases such as “Creation of the states of the links by each node, called the link state packet (LSP)” and “Dissemination of LSPs to every other router, called flooding,” establishing the foundational steps before moving into algorithm details.

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

    The lecture shifts to the Dijkstra algorithm as the mechanism for forming shortest path trees. A slide titled “Formation of Shortest Path Tree: Dijkstra Algorithm” pairs “a. The weighted graph” with a “b. Link state database” table headed A B C D E F G, showing how the network’s weighted topology is represented as a cost matrix. The instructor gestures beside slides carrying red pen annotations, including red circles around several node cost tables on the network diagram. The Dijkstra slide states that “The Dijkstra algorithm creates a shortest path tree from a graph” and references tentative and permanent sets. A legend box defines “Root node,” “Node in path,” “Node not yet in the path,” “Potential path,” and “Path.” An Initialization diagram is shown, followed by panels labeled Iteration 1 through Iteration 6, each displaying nodes A–G with updated cumulative costs as the algorithm progresses.

  3. 5:00 – 7:53 05:00-07:53

    The final segment revisits the “Building Routing Tables” slide, now with red underlines on “link state packet (LSP)” and “flooding, in an efficient and reliable way,” plus red arrows emphasizing these terms. The network diagram of nodes A–G appears again with small per-node tables, several circled in red, and a red X is drawn over an edge between nodes to illustrate how link state information changes when links fail or costs change. A second slide states the “link-state database (LSDB)” and shows a weighted graph labeled “a. The weighted graph” next to a cost matrix labeled “b. Link state database,” reinforcing the connection between the physical topology, the collected LSP data, and the input to Dijkstra’s algorithm. The on-screen text includes “KG KNOWLEDGE” branding and the phrase “GATE,” indicating an exam-preparation context.

The lecture builds a coherent progression from the abstract four-step link state routing process to a concrete algorithmic implementation. It begins by defining what each router must do: create LSPs, flood them to all other routers, compute a shortest path tree, and derive the routing table. The network diagram with nodes A–G serves as a consistent visual anchor, with per-node cost tables showing the distributed nature of link state information. The transition to Dijkstra’s algorithm is motivated by the need for a systematic way to form shortest path trees from the collected link state database. The algorithm is presented with clear terminology—tentative and permanent sets—and a visual legend that distinguishes different node states during execution. The step-by-step iterations (Initialization through Iteration 6) demonstrate how cumulative costs are updated and paths are finalized, providing a worked example that students can follow. The final return to the Building Routing Tables slide with red annotations ties the algorithm back to the original process, emphasizing that LSP creation and flooding are prerequisites for Dijkstra’s input. The red X over an edge highlights the dynamic aspect of link state routing: when topology changes, LSPs are updated and shortest path trees are recomputed. Overall, the segment emphasizes both the distributed data collection phase (LSPs and LSDB) and the local computation phase (Dijkstra), which are the two pillars of link state routing.

Loading lesson…