Basics of Unicast Routing Protocol

Duration: 6 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/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 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.

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…