Basics of Distance Vector Routing

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-networks/net-layerrouting-protocol/dvr-rip-split-horizon/asset-basics-of-distance-vector-routing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Distance Vector Routing, a protocol where each node maintains a table of minimum distances to every other node and the next hop for forwarding packets. The instructor uses a five-node network graph (A, B, C, D, E) with weighted links to demonstrate how routing tables are initialized and updated. Initially, each node's table is filled with direct link costs; for example, Node A has a cost of 0 to itself, 5 to B, and 2 to C. Nodes without direct links initially show infinity (∞) as the cost. The lecture then explains how nodes exchange information with their neighbors: Node A learns about E via C, and Node C learns about D via A. A key update is shown where Node D's cost to reach B changes from infinity to 8, illustrating how indirect routes are discovered through neighbor tables. The core principle is that the least-cost route between any two nodes is the one with minimum distance, and tables guide packets by specifying the next stop in the route.

Chapters

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

    The video defines Distance Vector Routing as a protocol where the least-cost route between any two nodes is determined by minimum distance. Each node maintains a vector (table) of minimum distances to every other node, which also guides packets by showing the next hop. A network graph with five nodes (A, B, C, D, E) and weighted links is displayed alongside empty routing tables. The instructor begins filling Node A's table, starting with a cost of 0 to itself and entering direct link costs such as 5 to B and 2 to C.

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

    The instructor continues initializing routing tables for all nodes based on direct link costs. Node D's table shows a cost of 3 to A and infinity to others, while Node C's table lists costs of 2 to A, 4 to B, and 4 to E. Node E's table shows costs of 3 to B, 4 to C, and infinity to D. This phase establishes the initial state of each node's knowledge before any neighbor exchanges occur, emphasizing that nodes only know their immediate neighbors at the start.

  3. 5:00 – 8:44 05:00-08:44

    The lecture shifts to how nodes share tables with neighbors to learn about distant nodes. The instructor explains that Node A learns about E via C, and Node C learns about D via A. A red arrow highlights Node D's table as its cost to reach B is updated from infinity to 8, demonstrating the discovery of an indirect route. The slide reiterates that each node maintains a vector of minimum distances and next-hop guides, with the five-node graph centered to show the weighted links used in these calculations.

The lecture progresses from defining Distance Vector Routing to demonstrating its initialization and update mechanisms. Key concepts include the routing table structure (To, Cost, Next), direct link costs, and infinity for unknown routes. The worked example uses a five-node graph to show how nodes start with limited knowledge and expand it through neighbor exchanges. The update of Node D's cost to B from infinity to 8 is a critical demonstration of how indirect routes are calculated. Students should focus on understanding that tables guide packets via next-hop information and that updates propagate as neighbors share their distance vectors.

Loading lesson…