Basics of Unicast Routing Protocol

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/net-layerrouting-protocol/routing-basics-flooding/asset-basics-of-unicast-routing-protocol after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces unicast routing protocols as mechanisms that enable dynamic routing tables by allowing routers to exchange information about network changes. The instructor presents a slide titled “UNICAST ROUTING PROTOCOLS” and explains that routing protocols are combinations of rules and procedures enabling routers to inform each other about changes in the internet or their neighborhood. A key example is given: information sharing allows a router in Delhi to know about the failure of a network in Singapore. The slide also notes that routing protocols include procedures for combining information received from other routers and may require a router to maintain several routing tables based on the required type of service. Hand-drawn sketches at the bottom of the slide illustrate simple topologies, including a node linked to “R,” a fan-out with labels like K1/K2 and the word “multi,” and a hub-and-spoke diagram with “S” at the center. Red underlines and circles emphasize key terms such as “demand,” “rules and procedures,” and the Delhi–Singapore example. The presentation remains on this single slide throughout the sampled windows, with the instructor elaborating on definitions and functions.

Chapters

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

    The slide titled “UNICAST ROUTING PROTOCOLS” appears with four bullet points on dynamic routing tables and information sharing. The instructor begins explaining that routing protocols have been created in response to the demand for dynamic routing tables, and that a routing protocol is a combination of rules and procedures that lets routers inform each other. Small red hand-drawn sketches appear at the bottom, showing a node linked to “R” and a fan-out labeled K1/K2 with the word “multi.”

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

    The instructor continues on the same slide, emphasizing that protocols allow routers to share what they know about the internet or their neighborhood. The bullet point “The sharing of information allows a router in Delhi to know about the failure of a network in Singapore” is underlined as a concrete example. A third sketch, a hub-and-spoke with “S” at the center, is added. The instructor also notes that protocols include procedures for combining information and that a router may have several routing tables based on the required type of service.

  3. 5:00 – 5:37 05:00-05:37

    The final sampled frames remain on the “UNICAST ROUTING PROTOCOLS” slide. The instructor gestures while discussing the combination of rules and procedures, with red annotations highlighting key terms such as “demand,” “rules and procedures,” and the geographic example. The slide’s bullet points on sharing information, combining received data, and multiple routing tables stay visible as the segment concludes.

The core teaching point is that unicast routing protocols provide the rules and procedures for dynamic routing tables, enabling routers to exchange neighborhood information so that failures or changes propagate across the network. The Delhi–Singapore example concretizes this by showing how one router can learn about a distant failure through information sharing. The instructor also distinguishes between the basic exchange of information and the additional procedures for combining that information, as well as the possibility of maintaining multiple routing tables depending on service requirements. The hand-drawn topology sketches support these ideas by illustrating simple connection patterns, including a hub-and-spoke arrangement. Because the evidence comes only from sampled screenshots without audio or transcript, the exact phrasing of spoken explanations is inferred from on-screen text and annotations; however, the slide content consistently centers on dynamic routing tables, information sharing, combination of received data, and multiple service-based routing tables.

Loading lesson…