Link State Routing Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/HEXAWARE-PREPARATION/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. Quantitative Ability: Speed Mathematics and Basic Mathematics, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Number System, HCF LCM, Data Interpretation, Age Problems, Mixture and Alligation, Partnership, Algebra, Sequence and Series (Series), Mensuration and Geometry, Arithmetic
  2. Reasoning Ability: Puzzle Solving (Puzzles), Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Data Sufficiency, Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Data Arrangement, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Vocabulary, Sentence Completion (Fill in the blanks), Active Passive Voice (Voice), Direct and Indirect Speech, Subject Verb Agreement (Verb Noun Agreement), Tenses, Preposition, Articles, Sentence Correction (Error Correction)
  4. Programming Basics (MCQs + Interview): C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  5. OOPs (MCQs + Interview): Object Oriented Programming (OOPS)
  6. DBMS (MCQs + Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Decomposition Properties & 4NF, Concurrency Control, Database Recovery, File Organization & Indexing, Relational Algebra, Database Security & Authorization
  7. SQL (MCQs + Interview): SQL
  8. Operating Systems (MCQs + Interview): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Process Synchronization, Disc Scheduling, File Management, Security
  9. Computer Networks (MCQs + Interview): 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, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  10. Coding: Coding Questions by Yash Sir
  11. HR Interview: MR & HR Interview Preparation
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…