Link State Routing Part-2

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/computer-network/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 Course: About the Course
  2. Programming and Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up
  3. C++ and Java Programming: OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java, Generic & Collections, Multithreading, File Handling & I/O, Java, Object Oriented Technology
  4. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  5. Teaching Methodology / शिक्षण विधि: Growth and Development / वृद्धि और विकास, शिक्षा का अर्थ, उद्देश्य एवं दर्शन / Meaning, Aims and Philosophy of Education, Theories of Development / विकास के सिद्धांत, Inclusive Education / समावेशी शिक्षा, विज्ञान शिक्षणशास्त्र / Science Pedagogy, Assessment and Evaluation / आकलन और मूल्यांकन, Socialisation and Gender / समाजीकरण और जेंडर, शिक्षा, समाज एवं जेंडर / Education, Society and Gender, Cognitive Processes / संज्ञानात्मक प्रक्रियाएँ, Teaching Planning and Teaching Skills / शिक्षण योजना और शिक्षण कौशल, Personality Development / व्यक्तित्व विकास, Teaching Methods / शिक्षण विधियाँ, Learning and Behavioural Theories / अधिगम और व्यवहारवादी सिद्धांत, व्यक्तिगत भिन्नताएँ, क्षमताएँ और व्यक्तित्व / Individual Differences, Abilities and Personality, अभिप्रेरणा और स्वनिर्देशित अधिगम / Motivation and Self-Directed Learning, Teaching Methods and Approaches / शिक्षण विधियाँ एवं उपागम, Teaching-Learning Process and Classroom Management / शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी, Microteaching and Classroom Communication / सूक्ष्म शिक्षण एवं कक्षा संप्रेषण, Assessment and Evaluation / आकलन एवं मूल्यांकन, Curriculum, Arts and Co-curricular Areas / पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र, Education of Children with Disabilities / दिव्यांग बच्चों की शिक्षा, Teacher: Qualities, Professional Ethics and Development / शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास, समावेशी शिक्षा / Inclusive Education, Social Psychology / सामाजिक मनोविज्ञान, Data Collection and Measurement / आँकड़ा संग्रह एवं मापन, Educational Objectives and Bloom's Taxonomy / शैक्षिक उद्देश्य एवं ब्लूम का वर्गीकरण, Lesson Planning / पाठ योजना, Guidance and Counselling / निर्देशन एवं परामर्श, Educational Psychology / शैक्षिक मनोविज्ञान, Mental Health and Guidance / मानसिक स्वास्थ्य और मार्गदर्शन, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री और शैक्षिक तकनीकी, वाक्य-विचार, लेखन, पत्रकारिता और प्रयोजनमूलक हिंदी, हिंदी शिक्षणशास्त्र, Phonetics and Linguistics, Transformation of Sentences, Writing Skills, Indian, American and World Literature, Foundations of Communication / संचार की मूल अवधारणाएँ, Language, Culture and Nonverbal Signals / भाषा, संस्कृति और अभाषिक संकेत, Listening, Conversation and Communication Skills / श्रवण, वार्तालाप और संचार कौशल, Research: Meaning, Characteristics and Types / शोध: अर्थ, विशेषताएँ एवं प्रकार, Methods of Research and Research Design / शोध विधियाँ एवं अभिकल्प, Research Ethics / शोध नैतिकता, Paper, Article and Academic Events / शोध-पत्र, लेख एवं शैक्षिक आयोजन, अनुक्रम, श्रेणी और संयोजन / Sequences, Series and Combinatorics, आव्यूह और रैखिक बीजगणित / Matrices and Linear Algebra, वास्तविक और सम्मिश्र विश्लेषण / Real and Complex Analysis, Mathematics Pedagogy / गणित शिक्षणशास्त्र, Science and Scientific Inquiry / विज्ञान एवं वैज्ञानिक जाँच, Social Science Pedagogy / सामाजिक विज्ञान शिक्षणशास्त्र, संस्कृतशिक्षणम्, Natural Hazards and Disasters / प्राकृतिक संकट एवं आपदाएँ, Teaching Geography / भूगोल शिक्षण, Pedagogy of Economics / अर्थशास्त्र का शिक्षणशास्त्र, भारतीय राजनीति और जनभागीदारी / Indian Politics and Participation, Molecular Basis of Inheritance / वंशागति का आणविक आधार, Pedagogy of Biology / जीव विज्ञान का शिक्षणशास्त्र, Pedagogy of History / इतिहास शिक्षणशास्त्र, Society, Community and Social Groups / समाज, समुदाय और सामाजिक समूह, Family, Marriage and Kinship / परिवार, विवाह और नातेदारी, Social Stratification and Inequality / सामाजिक स्तरीकरण और असमानता, Physical Education Pedagogy and Inclusion / शारीरिक शिक्षा का शिक्षणशास्त्र एवं समावेशन, Apparel Design and Care / परिधान डिज़ाइन और देखभाल, Extension Education and Development Communication / प्रसार शिक्षा और विकास संचार, Nature, History and Schools of Psychology / मनोविज्ञान का स्वरूप, इतिहास और सम्प्रदाय, Research Methods and Statistics / अनुसंधान विधियाँ और सांख्यिकी, Biological Bases of Behaviour / व्यवहार के जैविक आधार, Sensation, Attention and Perception / संवेदन, अवधान और प्रत्यक्षण, Learning / अधिगम, Thinking, Language, Intelligence and Creativity / चिंतन, भाषा, बुद्धि और सृजनात्मकता, Motivation and Emotion / अभिप्रेरणा और संवेग, Self, Personality and Stress / आत्म, व्यक्तित्व और तनाव, Psychological Disorders / मनोवैज्ञानिक विकार, Therapeutic Approaches / चिकित्सा उपागम, Industrial and Organisational Psychology / औद्योगिक और संगठनात्मक मनोविज्ञान, Fundamentals, Media and Techniques of Art / कला के मूल तत्व, माध्यम और तकनीक, Indian Miniature Painting Schools / भारतीय लघुचित्र शैलियाँ, Modern Western Art / आधुनिक पाश्चात्य कला, Indian and Western Aesthetics / भारतीय और पाश्चात्य सौन्दर्यशास्त्र, Art Pedagogy / कला शिक्षण, Fundamentals of Dance / नृत्य के मूल तत्व, History of Indian Dance and Treatises / नृत्य का इतिहास और शास्त्रीय ग्रंथ, Music Aesthetics and Music Teaching / संगीत सौंदर्यशास्त्र एवं संगीत शिक्षण, General Concepts of Philosophy / दर्शन के सामान्य प्रत्यय, Modern Western Philosophy: Descartes to Hume / आधुनिक पाश्चात्य दर्शन: देकार्त से ह्यूम, Social and Political Philosophy / सामाजिक एवं राजनीतिक दर्शन, Statement-Based Reasoning / कथन आधारित तार्किक विवेचन, Data Sufficiency and Decision Making / आँकड़ों की पर्याप्तता एवं निर्णय क्षमता, Educational Policies, Acts and Administration / शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन, Vocabulary, Sentence Structure and Common Errors, मानव विकास / Human Development
  6. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  7. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  8. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  9. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, CSS, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML, Ajax
  10. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Instr Formats & Modes, Floating Point Rep
  11. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  13. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  14. Mathematics - I, II, III, IV / गणित - I, II, III, IV: Permutation and Combination / क्रमचय और संचय, Logarithm / लघुगणक, Linear Algebra / रैखिक बीजगणित, Algebra / बीजगणित, Calculus / कलन, Trigonometry / त्रिकोणमिति, Vectors / सदिश, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps / शोध प्रक्रिया के चरण, Graph Theory, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Number Systems and Number Theory / संख्या पद्धति और संख्या सिद्धांत, Euclidean Geometry and Mensuration / यूक्लिडीय ज्यामिति और क्षेत्रमिति, Statistics and Probability / सांख्यिकी और प्रायिकता, Coordinate Geometry, Vectors and 3D Geometry / निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ, Plane Mensuration / समतल क्षेत्रमिति, Sampling / प्रतिचयन, Percentage / प्रतिशत, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Ratio and Proportion / अनुपात और समानुपात
  15. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  16. AI & Emerging Trends: Emerging Trends and AI, Knowledge Representation, Natural Language Processing
  17. Society, Ethics and Cyber Laws: Society, Law & Ethics, Computer Software, डिजिटल समाज, नैतिकता और साइबर कानून / Digital Society, Ethics and Cyber Law, Digital India and Online Services, Culture, Socialisation and Social Control / संस्कृति, समाजीकरण और सामाजिक नियंत्रण
  18. Statistical Techniques / सांख्यिकीय तकनीकें: Probability / प्रायिकता, Statistics / सांख्यिकी, Average / औसत, Mixture and Alligation / मिश्रण और एलिगेशन, Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज, Solid Mensuration / घन क्षेत्रमिति, Number System / संख्या पद्धति, Age Problems / आयु संबंधी प्रश्न, Partnership / साझेदारी
  19. Interpolation - DI / अंतर्वेशन - DI: Data Interpretation / आँकड़ा निर्वचन
  20. Basis of Physics / भौतिकी का आधार: Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान, Measurement and Mathematical Methods / मापन और गणितीय विधियाँ, गति और गति के नियम / Motion and Laws of Motion, कार्य, ऊर्जा, शक्ति और घूर्णी गति / Work, Energy, Power and Rotational Motion, Gravitation / गुरुत्वाकर्षण, Mechanical Properties of Matter / पदार्थ के यांत्रिक गुण, Thermal and Statistical Physics / तापीय और सांख्यिकीय भौतिकी, Oscillations and Mechanical Waves / दोलन और यांत्रिक तरंगें, Electrostatics and Current Electricity / स्थिरवैद्युतिकी और धारा विद्युत, Magnetism, Induction and Alternating Current / चुम्बकत्व, प्रेरण और प्रत्यावर्ती धारा, विद्युतचुम्बकीय तरंगें और विकिरण / Electromagnetic Waves and Radiation, Optics and Photonics / प्रकाशिकी और फोटोनिकी, Quantum Physics and Relativity / क्वांटम भौतिकी और आपेक्षिकता, Atoms, Nuclei and Astrophysics / परमाणु, नाभिक और खगोल भौतिकी, Solid State Physics and Electronics / ठोस अवस्था भौतिकी और इलेक्ट्रॉनिकी
  21. Business Studies and Management / व्यवसाय अध्ययन एवं प्रबंधन: Video Lectures, Business Communication / व्यावसायिक संचार, Principles and Functions of Management / प्रबंध के सिद्धांत एवं कार्य, Accounting Fundamentals and Recording of Transactions / लेखांकन के आधार एवं लेन-देनों का अभिलेखन, Depreciation, Final Accounts and Computerised Accounting / ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन, Knowledge Management & New Economy / ज्ञान प्रबंधन और नई अर्थव्यवस्था, Business Foundations and Entrepreneurship / व्यवसाय के आधार एवं उद्यमिता, Consumer Behaviour and Demand / उपभोक्ता व्यवहार एवं माँग, Internet and Web Services, Introduction to Economics / अर्थशास्त्र का परिचय, Production and Costs / उत्पादन एवं लागत, National Income Accounting / राष्ट्रीय आय लेखांकन, Determination of Income and Employment / आय एवं रोज़गार का निर्धारण, Public Finance and Government Budget / लोक वित्त एवं सरकारी बजट, Economic Growth and Development / आर्थिक संवृद्धि एवं विकास, भारतीय अर्थव्यवस्था / Indian Economy, Consumer Finance, Careers and Entrepreneurship / उपभोक्ता वित्त, करियर और उद्यमिता, Profit, Loss and Discount / लाभ, हानि और बट्टा, Special Accounts / विशेष लेखे, Partnership Accounts / साझेदारी लेखांकन, Company Accounts / कंपनी लेखांकन, Analysis of Financial Statements / वित्तीय विवरणों का विश्लेषण, Cost and Management Accounting / लागत एवं प्रबंध लेखांकन, अंकेक्षण / Auditing, Business Finance, Banking and Financial Markets / व्यावसायिक वित्त, बैंकिंग एवं वित्तीय बाज़ार, Business Law and Taxation / व्यावसायिक विधि एवं कराधान, Business Mathematics and Statistics / व्यावसायिक गणित एवं सांख्यिकी, Banking, Insurance and Financial Markets / बैंकिंग, बीमा एवं वित्तीय बाजार, Sentence Completion (Fill in the blanks)
  22. MIS / DSS / Expert Systems: Information Systems, MS Office Applications, Terms & Abbreviations
  23. E-Commerce: Volume - I, Volume - II
  24. Previous Year Paper:
  25. Full Mock Test:
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…