Basics of Distance Vector Routing

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/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. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. Paper 2 | 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock 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…