Routing Information Protocol (RIP)

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/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 the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. 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, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. 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
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
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…