RARP - Reverse Address Resolution Protocol
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- 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
- Paper-1 & 2 | Data Interpretation: Data Interpretation
- Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
- 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
- Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
- Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
- Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
- Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
- Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
- 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
- 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
- Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
- 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
- Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
- 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
- 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
- Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
- Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
- Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
- Live Sessions: RSSB Live Sessions
- RSSB Paper 1 - Full Mock Tests:
- RSSB Paper 2 - Full Mock Tests:
- SCI Previous Year Papers:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the Reverse Address Resolution Protocol (RARP), explaining how a diskless machine that knows only its physical hardware address can discover its logical IP address. The instructor presents a slide defining RARP as the protocol that finds the logical address for a machine knowing only its physical address. The teaching flow moves from conceptual motivation—hosts and routers are assigned unique logical IP addresses independent of physical hardware, and normally the IP is read from a disk configuration file—to the special case where a diskless machine boots from ROM and must obtain its IP via RARP. The second half of the video focuses on a two-part diagram illustrating the request/reply exchange: part (a) shows the RARP request being broadcast on the local network, with a yellow callout stating “My physical address is A4:6E:A5:57:82:36. I am looking for my IP address,” and part (b) shows the RARP reply being sent as a unicast from the server back to the host, with the callout “Your IP address is 141.14.56.21.” The instructor emphasizes that the requesting machine runs a RARP client while the responding machine runs a RARP server, and uses gestures to highlight the host icon and the broadcast/unicast distinction. The lesson is concise, centered on one slide set with a supporting diagram.
Chapters
0:00 – 2:00 00:00-02:00
The instructor presents a slide titled “RARP” defining the Reverse Address Resolution Protocol as finding the logical address for a machine that knows only its physical address. On-screen bullets explain that each host or router is assigned one or more logical (IP) addresses unique and independent of the physical hardware address, that an IP is usually read from a disk configuration file, but that a diskless machine boots from ROM and can only get its physical address by reading its NIC. The instructor gestures toward the slide to emphasize the relationship between physical and logical addresses, setting up why RARP is needed for diskless booting.
2:00 – 3:28 02:00-03:28
The slide shifts to the RARP exchange with two bullets stating that a RARP request is broadcast on the local network and that the requesting machine runs a RARP client while the responder runs a RARP server. Diagram “a. RARP request is broadcast” shows a Host sending a Request toward a RARP server, with a yellow note reading “My physical address is A4:6E:A5:57:82:36. I am looking for my IP address.” Diagram “b. RARP reply is unicast” shows a Reply arrow from the server back to the Host, with the note “Your IP address is 141.14.56.21.” The instructor enters, draws an oval around the Host icon, and points to it with a pen, reinforcing the client/server roles and the broadcast request versus unicast reply.
The core concept is that RARP reverses the usual ARP direction: given a known physical (MAC) address, it discovers the corresponding logical IP address. The lecture first motivates this by contrasting normal disk-based IP configuration with a diskless machine that boots from ROM and can only read its NIC’s physical address. It then demonstrates the protocol operation through a two-part diagram: the client broadcasts a request containing its physical address, and a RARP server on the local network replies with the mapped IP address using unicast. Key takeaways for revision are: (1) RARP maps physical to logical address; (2) the request is broadcast, while the reply is unicast; (3) the requester runs a RARP client and the responder runs a RARP server. The concrete example uses physical address A4:6E:A5:57:82:36 and IP 141.14.56.21, which students should recall as the canonical illustration of the exchange.