ARP-Address Resolution Protocol

Duration: 5 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-arp-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 Address Resolution Protocol (ARP) as a network-layer auxiliary protocol that maps an IP address to a logical-link address. The instructor uses a slide with the title circled in marker, three bullets, and a diagram showing ICMP, IGMP, and IP inside a Network layer box, with an arrow from IP to ARP and then to Link-layer address. The core idea is that an IP address alone cannot move a frame through a link; ARP supplies the required link-layer address to the data-link layer. The second half walks through the ARP exchange: when a host or router needs another node’s link-layer address on its local network, it sends an ARP request packet containing the sender’s and receiver’s IP addresses plus the sender’s link-layer address. Because the sender does not know the receiver’s link-layer address, the query is broadcast over the link. The intended recipient replies with a unicast packet containing its IP and link-layer addresses, sent directly to the node that issued the request. Diagrams show System A and System B on a LAN with labels such as N1 L1, N2 L2, N3 L3, and N4 L4, illustrating that the request asks for the link-layer address of a node with IP address N2 and the reply states that the node’s link-layer address is L2.

Chapters

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

    The opening slide is titled “Address Resolution Protocol (ARP),” with the title hand-circled in marker. Three bullets state that ARP maps an IP address to a logical-link address and that ARP is one of the auxiliary protocols defined in the network layer. A diagram inside a box labeled “Network layer” shows ICMP, IGMP, and IP blocks; an arrow from IP marked “IP address” feeds a blue ARP box and then down to “Link-layer address.” Red hand-drawn circles highlight the title, the underlined words “network layer,” and a looped arrow at the right of the diagram. The instructor emphasizes that an IP address alone cannot move a frame through a link, so ARP passes the resolved link-layer address to the data-link layer.

  2. 2:00 – 4:34 02:00-04:34

    The instructor explains the ARP request/reply process using a slide with five numbered points and two LAN diagrams. Point 1 reads: “Anytime a host or a router needs to find the link-layer address of another host or router in its network, it sends an ARP request packet.” Point 3 reads: “Because the sender does not know the link-layer address of the receiver, the query is broadcast over the link.” Point 5 reads: “The response packet contains the recipient's IP and link-layer addresses. The packet is unicast directly to the node that sent the request packet.” Diagrams show System A and System B on a LAN with node labels N1 L1, N2 L2, N3 L3, and N4 L4. The request is labeled “Looking for link-layer address of a node with IP address N2,” and the reply is labeled “I am the node and my link-layer address is L2.” The instructor points to the diagrams with a pen, highlighting that “a. ARP request is broadcast” and “b. ARP reply is unicast.”

The lesson centers on one key definition: ARP maps an IP address to a logical-link address. It is positioned as a network-layer auxiliary protocol, shown alongside ICMP and IGMP within the Network layer box. The teaching flow moves from definition to mechanism: first, why ARP is needed (IP alone cannot move a frame through a link), then how it works (broadcast request, unicast reply). The broadcast/unicast distinction is the main conceptual contrast: the request is broadcast because the sender does not know the receiver’s link-layer address, while the reply is unicast directly to the requester. The worked example uses System A and System B on a LAN, with node labels N1 L1 through N4 L4; the request asks for the link-layer address of IP N2, and the reply identifies itself as that node with link-layer address L2. For exam revision, students should remember the ARP packet contents (sender and receiver IP addresses, sender link-layer address), the broadcast nature of the request, and the unicast nature of the reply.

Loading lesson…