RARP - Reverse Address Resolution Protocol

Duration: 3 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-layer-ipv4-proto/net-layer-protocols/asset-rarp-reverse-address-resolution-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.

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

  1. 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. 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.

Loading lesson…