Routing Information Protocol (RIP)

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layerrouting-protocol/dvr-rip-split-horizon/asset-routing-information-protocol-rip after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the Routing Information Protocol (RIP), a widely used intradomain routing protocol based on distance-vector algorithms. The instructor defines RIP’s metric as hop count, using a network diagram with hosts N1 through N4 and routers R1 through R3 to illustrate 1-hop, 2-hop, and 3-hop paths. The lesson then covers the RIP algorithm, emphasizing that routers send entire forwarding tables rather than only distance vectors. The receiver adds one hop to each cost and updates the next-router field; routes are added if new, or replaced if cheaper. The final section explains RIP’s periodic, expiration, and garbage collection timers, noting that expired routes have hop count set to 16. It concludes with RIP performance characteristics: less traffic, convergence of forwarding tables, and robustness.

Chapters

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

    The opening slide is titled “Routing Information Protocol (RIP)” and states that RIP is one of the most widely used intradomain routing protocols based on distance-vector routing. A “Metric” section defines hop count as the number of networks a packet travels from source router to final destination host. A diagram shows N1 Source through N4 Destination linked by R1, R2, and R3, with labels “1 hop (N4),” “2 hops (N3, N4),” and “3 hops (N2, N3, N4).” Red underlines highlight key phrases.

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

    The “RIP Algorithm” slide explains that, instead of sending only distance vectors, a router sends the whole contents of its forwarding table in update messages. The receiver adds one hop to each cost and changes the next router field to the sending router’s address. Three route-selection cases are listed: add a received route if it does not exist in the old forwarding table; select it if its cost is lower than the old route’s cost. The section transitions to “Timers in RIP,” introducing periodic, expiration, and garbage collection timers.

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

    The “Timers in RIP” slide details the periodic timer, which controls advertising of regular update messages, and the expiration timer, which governs route validity. It states that when a route expires, “the hop count of the route is set to 16,” with 16 circled in red. The final “Performance of RIP” slide lists three characteristics: Less Traffic, Convergence of Forwarding Tables, and Robustness.

The lecture progresses from definition to operation. First, RIP is positioned as an intradomain distance-vector protocol whose metric is hop count, illustrated with a simple multi-router topology. Next, the algorithm’s update mechanism is explained: full forwarding-table advertisements, cost increment by one hop, and route replacement rules. Finally, timers operationalize reliability—periodic updates, expiration at hop count 16, and garbage collection—while performance points summarize RIP’s practical advantages. The central ideas are hop-count metric, full-table updates, and timer-based route aging; minor details include specific slide annotations.

Loading lesson…