ARP-Address Resolution Protocol

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/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 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
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…