Basics of Unicast Routing Protocol

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/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. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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…