ARP-Address Resolution Protocol

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-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. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: Introduction to CN, Data Communication, 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, Network Security
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…